3330 Ch07 wo ans

# 3330 Ch07 wo ans - 7: INTRODUCTION TO LINEAR PROGRAMMING...

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

7: INTRODUCTION TO LINEAR PROGRAMMING MULTIPLE CHOICE 1. The maximization or minimization of a quantity is the a. goal of management science. b. decision for decision analysis. c. constraint of operations research. d. objective of linear programming. ANSWER: d TOPIC: Introduction 2. 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. ANSWER: a TOPIC: Objective function 3. Which of the following is a valid objective function for a linear programming problem? a. Max 5xy b. Min 4x + 3y + (2/3)z c. Max 5x 2 + 6y 2 d. Min (x 1 + x 2 )/x 3 ASNWER: b TOPIC: Objective function 4. Which of the following statements is NOT true? a. A feasible solution satisfies all constraints. b. An optimal solution satisfies all constraints. c. An infeasible solution violates all constraints. d. A feasible solution point does not have to lie on the boundary of the feasible region. ANSWER: c TOPIC: Graphical solution 5. 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. ANSWE R: c TOPIC: Graphical solution 6. Slack 1

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

View Full Document
2 Chapter 7 Introduction to Linear Programming 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. ANSWER: b TOPIC: Slack variables 7. To find the optimal solution to a linear programming problem using the graphical method a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location. c. find the feasible point that is closest to the origin. d. None of the alternatives is correct. ANSWER: d TOPIC: Extreme points 8. 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. ANSWER: a TOPIC: Special cases 9. 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. ANSWER: b TOPIC: Right-hand sides 10. 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. ANSWER: c TOPIC: Objective function 11. Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints is a. at least 1.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/26/2012 for the course ADMS ADMS 3330 taught by Professor Adms3330 during the Spring '10 term at York University.

### Page1 / 17

3330 Ch07 wo ans - 7: INTRODUCTION TO LINEAR PROGRAMMING...

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

View Full Document
Ask a homework question - tutors are online