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


a1y1 + a2y2 + ……….+anyn  ≥  b with b  ≥  0.


Leave a Reply

Your email address will not be published. Required fields are marked *