Review1 - Question I. Using the following constraints and...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
Question I. Using the following constraints and their graphical representation, answer the following multiple- choice questions. The shaded region with corner points A, B, C, D is the feasible region. 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1. If the objective function is to Minimize -x + 2y, which of points A, B, C, D is optimal? a. Point A b. Point B c. Point C d. Point D 2. If the objective function is to Maximize 3x + 5y, which of points A, B, C, D will be optimal? a. Both C and D b. Only A c. Only C d. Only D 3. At which of the points A, B, C, D does constraint 3 have a surplus (is not binding)? a. Only A b. Both A and B c. Only C d. Both C and D 4. If x – y 2 is added as an additional constraint, which of the points A, B, C and D will still be feasible? a. C and D will be feasible, A and B will be infeasible b. A, C and D will be feasible, B will be infeasible c. B will be feasible, A, C and D will be infeasible d. None of A, B, C, D will be feasible 5. Which of the following changes would make the feasible region infeasible (empty)? a. Add y 6 as a new constraint b. Add x + y 5 as a new constraint c. Add x 7 as a new constraint d. Delete constraint 3 6. Which of the following changes would make the feasible region unbounded? a. Delete constraint 4 b. Delete constraints 1 and 2 c. Delete constraints 2 and 4 d. None of the above 7. Which of the following are components of a mathematical model for decision making? a. Decision variables b. An objective function and constraints c. Input parameters. d. All of the above. 2
Background image of page 2
Which of the following statement(s) on linear programming models is/are correct? I. If a linear programming model has an optimal solution, then the feasible region cannot be empty. II. In order to obtain a feasible solution to an otherwise infeasible problem, some of the constraints must be relaxed. III. Changing the objective function will never make an infeasible problem feasible. a. Only I b. Only I and II c. Only II and III d. I, II and III 9. Which of the following cannot be a reason for conducting sensitivity analysis? a. Some of the input parameters of the model may not have been known with certainty. b. Some of the input parameters of the model are approximations or estimates. c. The model represents a dynamic environment in which some of the parameters are subject to change by time. d. None of the above. 10. Which of the following statement(s) is/are correct, given an optimal solution to a linear program? I. If a constraint has a shadow price of zero, then the current optimal solution satisfies the constraint as equality.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 14

Review1 - Question I. Using the following constraints and...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online