Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Statistics LibreTexts

6: Linear Programming - A Geometric Approach

( \newcommand{\kernel}{\mathrm{null}\,}\)

Learning Objectives

In this chapter, you will learn to:

  1. Solve linear programming problems that maximize the objective function.
  2. Solve linear programming problems that minimize the objective function.

Thumbnail: A pictorial representation of a simple linear program with two variables and six inequalities. The set of feasible solutions is depicted in yellow and forms a polygon, a 2-dimensional polytope. The linear cost function is represented by the red line and the arrow: The red line is a level set of the cost function, and the arrow indicates the direction in which we are optimizing. (CC0; Ylloh via Wikipedia)


This page titled 6: Linear Programming - A Geometric Approach is shared under a CC BY license and was authored, remixed, and/or curated by Rupinder Sekhon and Roberta Bloom.

Support Center

How can we help?