Question

In linear programming feasible region (or solution region) for the problem is ____________.

Options

• The common region is determined by all the objective functions including the non – negative constraints `"x" ge 0, "y" ge 0`

• The common region determined by all the `"x" ge 0` and the objective function

• The common region is determined by all the constraints including the non – negative constraints `"x" ge 0, "y" ge 0`

• The common region is determined by all the `"x" ge 0, "y" ge 0` and the objective function

Answer 1

In linear programming feasible region (or solution region) for the problem is The common region is determined by all the constraints including the non – negative constraints `"x" ge 0, "y" ge 0`.

Explanation:

The viable region (or solution region) for a problem in linear programming is determined by the common region dictated by all constraints, including non-negative constraints `"x" ge 0, "y" ge 0`