1. In a linear programming problem, there can only be one:

• A. objective function
• B. decision variable
• C. constraint
• D. uncontrollable variable
• E. input parameter

2. MSA Computer Corporation manufactures two models of minicomputers, the Alpha 4 and the Beta 5. The firm employs 5 technicians, working 160 hours each per month, on its assembly line. Management insists that full employment (that is, all 160 hours of time) be maintained for each worker during next month's operations. It requires 20 labour-hours to assemble each Alpha 4 computer and 25 labour-hours to assemble each Beta 5 model. MSA wants to see at least 5 Alpha 4s and at least 15 Beta 5s produced during the production period. Alpha 4s generate a $1,200 profit per unit, and Betas yield $1,800 each. The profitable number of Beta 5 model is

• A. 25
• B. 29
• C. 27
• D. 26
• E. 28

3. Which statement about linear programming is not true?

• A. The objective function always consists of either maximizing or minimizing some value.
• B. Both objective functions and constraints contain parameters.
• C. All linear programming models exhibit a set of constraints.
• D. Typically, finding a corner point for the feasible region involves solving a set of three simultaneous equations.
• E. The objective function is a linear relationship reflecting the objective of an operation.

4. The production planner for Fine Coffees, Inc. produces two coffee blends: American (A) and British (B). Two of his resources are constrained: Columbia beans, of which he can get at most 300 pounds (4,800 ounces) per week; and Dominican beans, of which he can get at most 200 pounds (3,200 ounces) per week. Each pound of American blend coffee requires 12 ounces of Colombian beans and 4 ounces of Dominican beans; while a pound of British blend coffee uses 8 ounces of each type of bean. Profits for the American blend are $2.00 per pound, and profits for the British blend are $1.00 per pound. Which of the following is not a feasible production combination?

• A. 400 A & 0 B
• B. 0 A & 400 B
• C. 200 A & 300 B
• D. 0 A & 0 B
• E. 400 A & 400 B

5. Which of the following statements is not correct?

• A. The decision variables in transportation problems are flows.
• B. In a typical network representation of the transportation problem, the nodes indicate geographic locations.
• C. In an optimized shipping plan, most of the shipments occur on the low-cost routes, but this is not always the case.
• D. Problems which deal with the direct distribution of products from supply locations to demand locations are called transportation problems.
• E. Shipments between supply points are possible in a transportation problem.