Standard Minimum Form

Standard Minimum Form

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

a. The objective function is to be minimized.

b. All variables are nonnegative.

c. All remaining constraints are stated in the form

 

a₁y₁ + a₂y₂ + ……….+a_ny_n  ≥  b with b  ≥  0.