Production Scheduling (MNET 416)                             Thursday, October 7, 2004

Quiz on Linear Programming

1. The primary objective of linear programming is to:

a. meet the standards set by customers

b. derive an answer to complex quadratic equation

c. make probabilistic judgments in real time business situations

d. best allocate scares resources to various uses

e. maximize profit

2. An LP problem has only one feasible solution.  True or False?

3. In LP problems the number of constraints must be less than or equal to the number of decision variables. True or False?

4. Coefficients of the objective function decision variables represent the contribution of each decision variable to the objective. True or False?

5. In LP problem, the term "constraint" refers to the factors that restrain us in achieving our objective. True or False?

6. The restriction "only 200 hours of labor is available" is represented mathematically as " ³ 200 ". True or False?

7. Quantities on the right-hand side of constraint functions represent:

a. decision variables

b. shadow prices

c. available quantities

d. artificial variables

e. variable coefficient

8. Maximization LP problems usually have more " £ " constraints. True or False?

9. The meaning of the term "feasible solution space" is the space containing all the points that satisfy all of the constraints. True or False?

10. The optimal solution to a minimization problem in the graphical LP solution method is always found on the inner perimeter of the feasible solution space. True or False?

11. A graphical solution procedure is usually limited to problems with two decision variables because the flat drawing surface has room for only two dimensions. True or False?

12. A slack variable represents the amount of unused resource. True or False?

13. A shadow price is the change in the value of the objective function for a change in the constraint's RHS by one unit. True or False?