Linear Optimization Quiz

1.	A Linear Programming (LP) formulation consists of three main parts. A. True B. False

2.	Linear Programming (LP) always involves either maximizing or minimizing an objective function. A. True B. False

3.	Without exception, all of the functions in graphical LP are either straight lines or families of straight lines. A. True B. False

4.	It is possible to have more than one corner point of the feasible set as an optimum solution to an LP problem. A. True B. False

5.	A shadow price tells how much a decision variable can be increased or decreased without changing the value of the solution. A. True B. False

6.	Which objective function is parallel to the line 4x + 2y = 200? A. 2x + 4y B. 2x + y C. 2x + 2y D. 2x - y E. 2x - 4y

7.	Which of these is not an assumption of linear programming models? A. Divisibility B. Additivity C. Negativity (inverse relationships) D. Linearity

8.	Which one of these would not be considered a component of an LP model? A. Shadow price B. Decision variable C. Constraint D. Parameter E. All are components

9.	Constraints in linear programming refer to: A. the maximum free memory space available in the computer B. the cost of the LP software C. management's willingness to allow the use of LP D. minimum or maximum resource availability or requirements E. all of the above are LP constraints

10.

The logical approach, from beginning to end, for assembling a linear programming model begins with: A. identifying the decision variables B. identifying the objective function C. specifying the objective function parameters D. identifying the constraint coefficients E. specifying the constraint parameters

This is the end of the test. When you have completed all the questions and reviewed your answers, press the button below to grade the test.