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 (xi ≥ 0).

c. All remaining constraints are stated in the form

a1x1 + a2x2 + ……….+anxn ≤  b with b ≥ 0.


Leave a Reply

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