FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 25: Linear Programming

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

Multiple Choice

Review LaterAdd Note

Review Later

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

A) Shadow pricing
B) Simplex
C) Slack
D) Surplus
E) Sensitivity analysis

F) A) and D)
G) B) and C)

Correct Answer

verified

Show Answer

Question 32

True/False

Review LaterAdd Note

Review Later

A change in the value of an objective function coefficient does not change the optimal solution.

A) True
B) False

Correct Answer

verified

Show Answer

Question 33

True/False

Review LaterAdd Note

A linear programming problem can have multiple optimal solutions.

What combination of x and y will provide a minimum for this problem? Maximize Z = $3x + $15y Subject to: 2x + 4y ? 12 5x + 2y ? 10

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. For the production combination of 0 American and 400 British, which resource is "slack" (not fully used) ?

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. Which of the following is not a feasible production combination?

In a linear programming problem, the objective function was specified as follows: Z = 2A + 4B + 3C The optimal solution calls for A to equal 4, B to equal 6, and C to equal 3. It has also been determined that the coefficient associated with A can range from 1.75 to 2.25 without the optimal solution changing. This range is called A's:

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. For the production combination of 180 root beer and 0 sassafras soda, which resource is slack (not fully used) ?

In linear programming, sensitivity analysis is associated with: (I) the objective function coefficient. (II) right-hand-side values of constraints. (III) the constraint coefficient.

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 is the constraint for sugar?

The simplex method is a general-purpose LP algorithm that can be used for solving only problems with more than six variables.

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

LP problems must have a single goal or objective specified.

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

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

Which of the following could not be a linear programming problem constraint?

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. For the production combination of 135 Lite and 0 Dark, which resource is slack (not fully used) ?

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?

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 list of basic variables did not change, but the value of the objective function increased by $30. This means that resource's Q's shadow price was:

The feasible solution space is the set of all feasible combinations of decision variables as defined by only binding constraints.