SampleFinalsp08 - MGMT330 Sample Final Exam Spring 2008...

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

View Full Document Right Arrow Icon
MGMT330 Sample Final Exam Spring 2008 Time allowed 3 hours Note: Answers to multiple choice are marked with an asterisk * Questions 1 – 22 are based on LP 1. Decision variables a. tell how much or how many of something to produce, invest, purchase, hire, etc.* b. represent the values of the constraints. c. measure the objective function. d. must exist for each constraint. 2. A solution that satisfies all the constraints of a linear programming problem except the nonnegativity constraints is called a. optimal. b. feasible. c. infeasible.* d. semi-feasible. 3. Slack a. is the difference between the left and right sides of a constraint. b. is the amount by which the left side of a constraint is smaller than the right side*. c. is the amount by which the left side of a constraint is larger than the right side. d. exists for each variable in a linear programming problem. 4. Which of the following special cases does not require reformulation of the problem in order to obtain a solution? a. alternate optimality* b. infeasibility c. unboundedness d. each case requires a reformulation. 5. The improvement in the value of the objective function per unit increase in a right-hand side is the a. sensitivity value. b. dual price.* c. constraint coefficient. d. slack value. 6. As long as the slope of the objective function stays between the slopes of the binding constraints a. the value of the objective function won't change. b. there will be alternative optimal solutions. c. the values of the dual variables won't change.* d. there will be no slack in the solution. 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
7. A constraint that does not affect the feasible region is a a. non-negativity constraint. b. redundant constraint.* c. standard constraint. d. slack constraint. 8. Whenever all the constraints in a linear program are expressed as equalities, the linear program is said to be written in a. standard form.* b. bounded form. c. feasible form. d. alternative form. 9. Only binding constraints form the shape (boundaries) of the feasible region. True or False? ANS: F 10.The constraint 5x 1 - 2x 2 0 passes through the point (20, 50). True or False? ANS: T 11.Alternative optimal solutions occur when there is no feasible solution to the problem. T or F? ANS: F 12.Because the dual price represents the improvement in the value of the optimal solution per unit increase in right-hand side, a dual price cannot be negative. T or F? ANS: F 13.No matter what value it has, each objective function line is parallel to every other objective function line in a problem. T or F? ANS: T 14.If a decision variable is not positive in the optimal solution, its reduced cost is a. what its objective function value would need to be before it could become positive.
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.

This document was uploaded on 09/23/2011.

Page1 / 9

SampleFinalsp08 - MGMT330 Sample Final Exam Spring 2008...

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