THEORETICAL QUESTIONS
  1. Define the following terms:
    1. A closed half plane
    2. A feasible solution
    3. A feasible region
    4. A convex set
    5. A convex polygon
    6. Vertexes
    7. Redundant constraint
  2. When is a linear programming problem said to have multiple solutions under graphical method?
  3. When is a linear programming problem said to have an unbounded solution under graphical method?
  4. When is a linear programming problem said to be infeasible?
  5. Enumerate the steps involved in solving a linear programming problem by graphical method.

Get Quantitative Techniques: Theory and Problems now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial