Exam 2: Linear Programming: Model Formulation and Graphical Solution
Exam 1: Management Science121 Questions
Exam 2: Linear Programming: Model Formulation and Graphical Solution122 Questions
Exam 3: Linear Programming: Computer Solution and Sensitivity Analysis95 Questions
Exam 4: Linear Programming: Modeling Examples90 Questions
Exam 5: Integer Programming107 Questions
Exam 6: Transportation, Transshipment, and Assignment Problems98 Questions
Exam 7: Network Flow Models104 Questions
Exam 8: Project Management116 Questions
Exam 9: Multicriteria Decision Making103 Questions
Exam 10: Nonlinear Programming72 Questions
Exam 11: Probability and Statistics152 Questions
Exam 12: Decision Analysis122 Questions
Exam 13: Queuing Analysis123 Questions
Exam 14: Simulation100 Questions
Exam 15: Forecasting133 Questions
Exam 16: Inventory Management157 Questions
Exam 17: the Simplex Solution Method90 Questions
Exam 18: Transportation and Assignment Solution Methods86 Questions
Exam 19: Integer Programming: the Branch and Bound Method63 Questions
Exam 20: Nonlinear Programming: Solution Techniques55 Questions
Exam 21: Game Theory64 Questions
Exam 22: Markov Analysis64 Questions
Select questions type
Multiple optimal solutions can occur when the objective function is ________ a constraint line.
(Multiple Choice)
4.9/5
(39)
When using the graphical method, only one of the four quadrants of an xy-axis needs to be drawn.
(True/False)
4.9/5
(42)
Graphical solutions to linear programming problems have an infinite number of possible objective function lines.
(True/False)
4.9/5
(31)
________ are at the endpoints of the constraint line segment that the objective function parallels.
(Short Answer)
4.8/5
(23)
A linear programming problem that results in a solution that is ________ usually indicates that the linear program has been incorrectly formulated.
(Short Answer)
4.8/5
(39)
In the graphical approach, simultaneous equations may be used to solve for the optimal solution point.
(True/False)
4.8/5
(30)
The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.
-Which of the following points is not feasible?

(Multiple Choice)
4.8/5
(31)
________ is the difference between the left- and right-hand sides of a greater than or equal to constraint.
(Short Answer)
4.9/5
(26)
In a linear programming problem, the binding constraints for the optimal solution are:
5x1 + 3x2 ≤ 30
2x1 + 5x2 ≤ 20
Which of these objective functions will lead to the same optimal solution?
(Multiple Choice)
4.8/5
(35)
Consider the following linear programming problem:
MIN Z = & 2x1 + 3x2
Subject to: x1 + 2x2 ? 20
5x1 + x2 ? 40
4x1 +6x2 ? 60
x1 , x2 ? 0
What is the optimal solution?
(Essay)
5.0/5
(29)
The poultry farmer decided to make his own chicken scratch by combining alfalfa and corn in rail car quantities. A rail car of corn costs $400 and a rail car of alfalfa costs $200. The farmer's chickens have a minimum daily requirement of vitamin K (500 milligrams) and iron (400 milligrams), but it doesn't matter whether those elements come from corn, alfalfa, or some other grain. A unit of corn contains 150 milligrams of vitamin K and 75 milligrams of iron. A unit of alfalfa contains 250 milligrams of vitamin K and 50 milligrams of iron. Formulate the linear programming model for this situation.
(Essay)
4.7/5
(35)
A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.
What would the be the new slope of the objective function if multiple optimal solutions occurred along line segment AB?

(Short Answer)
4.9/5
(37)
The ________ property of linear programming models indicates that the values of all the model parameters are known and are assumed to be constant.
(Short Answer)
4.8/5
(28)
Which of the following could not be a linear programming problem constraint?
(Multiple Choice)
4.7/5
(31)
The production manager for the Coory soft drink company is considering the production of two kinds of soft drinks: regular and diet. Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of the ingredients), limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. For the production combination of 135 cases of regular and 0 cases of diet soft drink, which resources will not be completely used?
(Multiple Choice)
4.8/5
(40)
The objective function is a linear relationship reflecting the objective of an operation.
(True/False)
4.8/5
(32)
Which of the following special cases does not require reformulation of the problem in order to obtain a solution?
(Multiple Choice)
4.8/5
(33)
Showing 61 - 80 of 122
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)