Standard Maximization Problem

A linear programming (LP) problem is called a standard maximization problem if:

  • We are to find the maximum (not minimum) value of the objective function.
  • All the variables x, y, z, ... are constrained to be non-negative.
  • All further constraints have the form Ax + By + Cz + . . . N (and not ) with N nonnegative.
Example

The following is a standard maximization problem:

    Maximize p = 2x - 3y + 4z subject to the constraints

    4x - 3y + z 3
    x + y + z 10
    2x + y - z 10,
    x 0, y 0, z 0

The following is not a standard maximization problem:

    Maximize p = 2x - 3y + z subject to

    4x - 3y + z 3
    3x - y       10
    x 0, y 0, z 0

The reason it is not a standard maximization problem is that the first inequality is not a "" one.

Go back to the previous tutorial to learn about standard linear programming problems before trying this tutorial.

Close this window to return to the tutorial.