Standard maximum Form

Standard maximum Form

A linear programming problem is in standard maximum form if the following conditions are satisfied.

a. The objective function is to be maximize.

b. All variables are nonnegative (xⁱ ≥ 0).

c. All remaining constraints are stated in the form

a₁x₁ + a₂x₂ + ……….+a_nx_n ≤  b with b ≥ 0.