Exam 19: Linear Programming

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. What are optimal weekly profits?

Which of the following is not a component of the structure of a linear programming model?

The owner of Crackers, Inc., produces two kinds of crackers: Deluxe (D) and Classic (C). She has a limited amount of the three ingredients used to produce these crackers available for her next production run: 4,800 ounces of sugar; 9,600 ounces of flour, and 2,000 ounces of salt. A box of Deluxe crackers requires 2 ounces of sugar, 6 ounces of flour, and 1 ounce of salt to produce; while a box of Classic crackers requires 3 ounces of sugar, 8 ounces of flour, and 2 ounces of salt. Profits for a box of Deluxe crackers are $.40; and for a box of Classic crackers, $.50. What are profits for the optimal production combination?

The theoretical limit on the number of decision variables that can be handled by the simplex method in a single problem is:

In graphical linear programming, when the objective function is parallel to one of the binding constraints, then:

_________________ is a means of assessing the impact of changing parameters in a linear programming model.

A constraint that does not form a unique boundary of the feasible solution space is a:

Consider the following linear programming problem: Minimize $Z = \$ 2 x + \$ 8 y$ Subject to: 8x+4y\geq64 2x+4y\geq32 y\geq2 Determine the optimum amounts of x and y in terms of cost minimization. What is the minimum cost?

What combination of x and y will provide a minimum for this problem? Minimize $Z = \$ 3 x + \$ 15 y$ Subject to: 2x+4y\geq12 5x+2y\geq10

A redundant constraint is one that:

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D). Two of his resources are constrained: production time, which is limited to 8 hours (480 minutes) per day; and malt extract (one of his ingredients), of which he can get only 675 gallons each day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract, while each keg of Dark beer needs 4 minutes of time and 3 gallons of malt extract. Profits for Lite beer are $3.00 per keg, and profits for Dark beer are $2.00 per keg. What is the time constraint?

The production planner for a private label soft drink maker is planning the production of two soft drinks: root beer (R) and sassafras soda (S). Two resources are constrained: production time (T), of which she has at most 12 hours per day; and carbonated water (W), of which she can get at most 1,500 gallons per day. A case of root beer requires 2 minutes of time and 5 gallons of water to produce, while a case of sassafras soda requires 3 minutes of time and 5 gallons of water. Profits for the root beer are $6.00 per case, and profits for the sassafras soda are $4.00 per case. What are optimal daily profits?

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.

An analyst, having solved a linear programming problem, determined that he had 10 more units of resource Q than previously believed. Upon modifying his program, he observed that the optimal solution did not change, but the value of the objective function increased by $30. This means that resource's Q's shadow price was:

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D). Two of his resources are constrained: production time, which is limited to 8 hours (480 minutes) per day; and malt extract (one of his ingredients), of which he can get only 675 gallons each day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract, while each keg of Dark beer needs 4 minutes of time and 3 gallons of malt extract. Profits for Lite beer are $3.00 per keg, and profits for Dark beer are $2.00 per keg. What are optimal daily profits?

A local bagel shop produces two products: bagels (B) and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each. What is the sugar constraint (in tablespoons)?

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. What is the objective function?

A local bagel shop produces two products: bagels (B) and croissants (C). Each bagel requires 6 ounces of flour, 1 gram of yeast, and 2 tablespoons of sugar. A croissant requires 3 ounces of flour, 1 gram of yeast, and 4 tablespoons of sugar. The company has 6,600 ounces of flour, 1,400 grams of yeast, and 4,800 tablespoons of sugar available for today's production run. Bagel profits are 20 cents each, and croissant profits are 30 cents each. What are optimal profits for today's production run?

In linear programming, a nonzero reduced cost is associated with a:

The term range of feasibility refers to coefficients of the objective function.