MCQ
For a linear programming equations, convex set of equations is included in region of:
  • A
    Feasible solutions
  • B
    Disposed solutions
  • C
    Profit solutions
  • D
    Loss solutions

Answer

  1. Feasible solutions

Solution:

In order for a linear programming problem to have a unique solution, the solution must exist at the intersection of two or more constraints.

Then the problem becomes convex and has a single optimum(maximum or minimum) solution.

Therefore the convex set of equations is included in the feasible region.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free