Review1_12S (1)

Review1_12S (1) - MANAGEMENT SCIENCE (MGMT 306) Spring...

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

View Full Document Right Arrow Icon
MANAGEMENT SCIENCE (MGMT 306) Spring Review Problems for Exam 1 Reminders: - The exam is on February 14, Tuesday, 6:30 – 7:30 p.m. in EE129 or EE170. Room and seating assignments will be announced on Katalyst. - The exam will be closed book and notes. You may bring a single 8.5” x 11” sheet of “crib” notes written on both sides to use in the exam. - Students who are eligible for a make-up exam or need extra time must contact the instructor at least one week prior to the exam date. - The exam will consist of two parts: Part 1: Multiple choice questions on basic concepts of linear and non-linear programming, the graphical solution method, Excel model and Solver’s parameters of linear programs, and sensitivity analysis of linear programs using the Excel output. Part 2: Linear programming modeling questions.   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
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?
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 12

Review1_12S (1) - MANAGEMENT SCIENCE (MGMT 306) Spring...

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

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