Question

Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then ____________.

विकल्प

• the objective function Z has no minimum value on R

• the objective function Z has both a maximum and a minimum value on R

• the objective function Z has only a minimum value on R

• the objective function Z has only a maximum value on R

Answer 1

Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function. If R is bounded, then the objective function Z has both a maximum and a minimum value on R.

Explanation:

For a linear programming problem, let R be the feasible region and Z = ax + by be the objective function. If R is bounded, the objective function Z has a maximum and a minimum value on R, both of which occur at R's corner point (vertex).