Chap006S - Chapter 06S - Linear Programming Chapter 06S...

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

View Full Document Right Arrow Icon
Chapter 06S - Linear Programming Chapter 06S Linear Programming True / False Questions 1. Linear programming techniques will always produce an optimal solution to an LP problem. FALSE Difficulty: Medium TLO: 1 Taxonomy: Knowledge 2. LP problems must have a single goal or objective specified. TRUE Difficulty: Easy TLO: 1 Taxonomy: Knowledge 3. Constraints limit the alternatives available to a decision-maker, removing constraints adds viable alternative solutions. TRUE Difficulty: Medium TLO: 1 Taxonomy: Knowledge 4. An example of a decision variable in an LP problem is profit maximization. FALSE Difficulty: Medium TLO: 1 Taxonomy: Knowledge 6-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
Chapter 06S - Linear Programming 5. The feasible solution space only contains points that satisfy all constraints. TRUE Difficulty: Easy TLO: 1 Taxonomy: Knowledge 6. The equation 5x + 7y = 10 is linear. TRUE Difficulty: Easy TLO: 1 Taxonomy: Knowledge 7. The equation 3xy = 9 is linear. FALSE Difficulty: Medium TLO: 1 Taxonomy: Knowledge 8. Graphical linear programming can handle problems that involve any number of decision variables. FALSE Difficulty: Easy TLO: 3 Taxonomy: Knowledge 9. An objective function represents a family of parallel lines. TRUE Difficulty: Medium TLO: 2 Taxonomy: Knowledge 6-2
Background image of page 2
Chapter 06S - Linear Programming 10. The term "iso-profit" line means that all points on the line will yield the same profit. TRUE Difficulty: Easy TLO: 2 Taxonomy: Knowledge 11. The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints. FALSE Difficulty: Hard TLO: 2 Taxonomy: Knowledge 12. The value of an objective function decreases as it is moved away from the origin. FALSE Difficulty: Medium TLO: 2 Taxonomy: Knowledge 13. A linear programming problem can have multiple optimal solutions. TRUE AACSB: AS Difficulty: Medium TLO: 1 Taxonomy: Knowledge 14. A maximization problem may be characterized by all greater than or equal to constraints. FALSE Difficulty: Medium TLO: 1 Taxonomy: Knowledge 6-3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Chapter 06S - Linear Programming 15. If a single optimal solution exists to a graphical LP problem, it will exist at a corner point. TRUE AACSB: RT Difficulty: Easy TLO: 3 Taxonomy: Knowledge 16. The simplex method is a general-purpose LP algorithm than can be used for solving only problems with more than six variables. FALSE Difficulty: Medium TLO: 4 Taxonomy: Knowledge 17. A change in the value of an objective function coefficient does not change the optimal solution. FALSE Difficulty: Medium TLO: 5 Taxonomy: Knowledge 18. The term "range of optimality" refers to a constraint's right-hand side quantity. TRUE Difficulty: Easy TLO: 5 Taxonomy: Knowledge 6-4
Background image of page 4
Chapter 06S - Linear Programming 19. A shadow price indicates how much a one-unit decrease/increase in the right-hand side value of a constraint will decrease/increase the optimal value of the objective function. TRUE
Background image of page 5

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

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

This note was uploaded on 12/17/2011 for the course OPER 501 taught by Professor Fsafas during the Spring '11 term at Manor.

Page1 / 39

Chap006S - Chapter 06S - Linear Programming Chapter 06S...

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

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