FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 19: Linear Programming

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

Multiple Choice

Review LaterAdd Note

Review Later

_______________ are limitations that restrict the alternatives available to those making the decisions.

A) Variables
B) Constraints
C) Objectives
D) Feasible
E) Parameters

F) A) and B)
G) A) and E)

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

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

A) I and II only
B) II and III only
C) I, II, and III
D) I and III only
E) I only

F) All of the above
G) A) and B)

Correct Answer

verified

Show Answer

Question 33

Multiple Choice

Review LaterAdd Note

Which of the following choices constitutes a simultaneous solution to these equations?

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

When we use less of a resource than was available, in linear programming that resource would be called non-__________.

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 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 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?

The logical approach, from beginning to end, for assembling a linear programming model begins with

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 Dominican bean constraint?

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?

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) ?

_______________ is/are a set of all feasible combinations of decision variables as defined by the constraints.

For the constraints given below, which point is in the feasible solution space of this minimization problem?

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

The equation 3 xy = 9 is linear.

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

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) ?

Constraints limit the alternatives available to a decision maker