Exam 25: Linear Programming

An electronics firm produces two models of pocket calculators: the A-100 (A), which is an inexpensive four-function calculator, and the B-200 (B), which also features square root and percent functions. Each model uses one (the same) circuit board, of which there are only 2,500 available for this week's production. Also, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators, of which the A-100 requires 15 minutes (.25 hours) each, and the B-200 requires 30 minutes (.5 hours) each to produce. The firm forecasts that it could sell a maximum of 4,000 A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each, and profits for the B-200 are $4.00 each. What is the assembly time constraint (in hours)?

In graphical linear programming to maximize profit, the objective function is: (I) a family of parallel lines. (II) a family of isoprofit lines. (III) interpolated. (IV) linear

The feasible solution space only contains points that satisfy all constraints.

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?

Using the enumeration approach, optimality is obtained by evaluating every coordinate.

Nonbinding constraints are not associated with the feasible solution space; i.e., they are redundant and can be eliminated from the matrix.

Graphical linear programming can handle problems that involve any number of decision variables.

For the products A, B, C, and D, which of the following could be a linear programming objective function?

A novice linear programmer is dealing with a three-decision-variable problem. To compare the attractiveness of various feasible decision-variable combinations, values of the objective function at corners are calculated. This is an example of:

Profit maximization could be an objective of an LP problem; but cost minimization cannot be the objective of an LP problem.

An electronics firm produces two models of pocket calculators: the A-100 (A), which is an inexpensive four-function calculator, and the B-200 (B), which also features square root and percent functions. Each model uses one (the same) circuit board, of which there are only 2,500 available for this week's production. Also, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators, of which the A-100 requires 15 minutes (.25 hours) each, and the B-200 requires 30 minutes (.5 hours) each to produce. The firm forecasts that it could sell a maximum of 4,000 A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each, and profits for the B-200 are $4.00 each. What is the objective function?

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

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?

In the graphical approach to linear programming, finding values for the decision variables at the intersection of corners requires the solving of:

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 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 is the sugar constraint (in tablespoons)?

In the range of feasibility, the value of the shadow price remains constant.

When a change in the value of an objective function coefficient remains within the range of optimality, the optimal solution also remains the same.

The region which satisfies all of the constraints in graphical linear programming is called the:

An electronics firm produces two models of pocket calculators: the A-100 (A), which is an inexpensive four-function calculator, and the B-200 (B), which also features square root and percent functions. Each model uses one (the same) circuit board, of which there are only 2,500 available for this week's production. Also, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators, of which the A-100 requires 15 minutes (.25 hours) each, and the B-200 requires 30 minutes (.5 hours) each to produce. The firm forecasts that it could sell a maximum of 4,000 A-100s this week and a maximum of 1,000 B-200s. Profits for the A-100 are $1.00 each, and profits for the B-200 are $4.00 each. For the production combination of 1,400 A-100s and 900 B-200s, which resource is slack (not fully used)?