Linear Programming Problems (LPP)

The standard form of the linear programming problem is used to develop the procedure for solving a general programming problem.

A general LPP is of the form

Max (or min) Z = c₁x₁ + c₂x₂ + … +c_nx_n

x₁, x₂, ....x_n are called decision variable.

subject to the constraints

.

.

.

c₁, c₂,…. C_n, a₁₁, a₁₂,…. a_mn are all known constants

Z is called the "objective function" of the LPP of n variables which is to be maximized or minimized.