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 21

Multiple Choice

Review LaterAdd Note

Review Later

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

A) $.50 D + $.40 C = Z
B) $.20 D + $.30 C = Z
C) $.40 D + $.50 C = Z
D) $.10 D + $.20 C = Z
E) $.60 D + $.80 C = Z

F) A) and E)
G) None of the above

Correct Answer

verified

Show Answer

Question 22

True/False

Review LaterAdd Note

Review Later

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

A) True
B) False

Correct Answer

verified

Show Answer

Question 23

Multiple Choice

Review LaterAdd Note

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

What combination of x and y will provide a minimum for this problem?

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

The logistics/operations manager of a mail order house purchases two products for resale: king beds (K) and queen beds (Q) . Each king bed costs $500 and requires 100 cubic feet of storage space, and each queen bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each king bed is $300 and for each queen bed is $150. Which of the following is not a feasible purchase combination?

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

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?

The logistics/operations manager of a mail order house purchases two products for resale: king beds (K) and queen beds (Q) . Each king bed costs $500 and requires 100 cubic feet of storage space, and each queen bed costs $300 and requires 90 cubic feet of storage space. The manager has $75,000 to invest in beds this week, and her warehouse has 18,000 cubic feet available for storage. Profit for each king bed is $300 and for each queen bed is $150. What is the maximum profit?

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

A shadow price reflects which of the following in a maximization problem?

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

Coordinates of all corner points are substituted into the objective function when we use the approach called

For a linear programming problem with the following constraints, which point is in the feasible solution space assuming this is a maximization problem?

A maximization problem is limited by all greater than or equal to constraints.

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

_______________ represent choices available to the decision maker in terms of the amounts of either inputs or outputs.

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

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

Once we go beyond two decision variables, typically the ___________ method of linear programming must be used.