The basic purpose of the simplex algorithm is to solve linear programming problems. In the following example, the function f (x, y) = x + y is to be maximized subject to the two inequalities shown. The function f (x, y) is the objective function, and the set of linear constraints is called the linear system.
To enter a linear programming problem with two constraints
Simplex + Maximize
, Maximum is at:
x =
, y = -
Of course, these are the same coordinates that minimize - x - y. In the following linear programming problem, click the matrix, and from the Simplex submenu choose Minimize.
Simplex + Minimize
, Minimum is at:
- x - y 4x + 3y≤6 3x + 4y≤4 y = -
, x =
![]()