FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 2: Linear Programming: Basic Concepts

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 31

True/False

Review LaterAdd Note

Review Later

When formulating a linear programming problem on a spreadsheet,the data cells will show the optimal solution.

A) True
B) False

Correct Answer

verified

Show Answer

Question 32

Multiple Choice

Review LaterAdd Note

Review Later

Given the following 2 constraints,which solution is a feasible solution for a maximization problem? (1) ) 14x₁ + 6x₂ $\le$ 42 (2) ) x₁ - x₂ $\le$ 3

A) (x₁,x₂ ) = (1,5) .
B) (x₁,x₂ ) = (5,1) .
C) (x₁,x₂ ) = (4,4) .
D) (x₁,x₂ ) = (2,1) .
E) (x₁,x₂ ) = (2,6) .

F) B) and E)
G) D) and E)

Correct Answer

verified

Show Answer

Question 33

Multiple Choice

Review LaterAdd Note

The owner of Crackers, Inc. produces both Deluxe (D) and Classic (C) crackers. She only has 4,800 ounces of sugar, 9,600 ounces of flour, and 2,000 ounces of salt for her next production run. A box of Deluxe crackers requires 2 ounces of sugar, 6 ounces of flour, and 1 ounce of salt to produce. A box of Classic crackers requires 3 ounces of sugar, 8 ounces of flour, and 2 ounces of salt to produce. Profits are 40 cents for a box of Deluxe crackers and 50 cents for a box of Classic crackers. -Which of the following is not a feasible solution?

The value of the objective function decreases as the objective function line is moved away from the origin.

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D) . He can only get 675 gallons of malt extract per day for brewing and his brewing hours are limited to 8 hours per day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract. 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 daily profit when producing the optimal amounts?

When solving linear programming problems graphically,there are an infinite number of possible objective function lines.

Figure -Where are the output cells located?

An electronics firm produces two models of pocket calculators: the A-100 (A) and the B-200 (B) . Each model uses one circuit board, of which there are only 2,500 available for this week's production. In addition, the company has allocated a maximum of 800 hours of assembly time this week for producing these calculators. Each A-100 requires 15 minutes to produce while each B-200 requires 30 minutes to produce. The firm forecasts that it could sell a maximum of 4,000 of the 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 time constraint?

After the data is collected the next step to formulating a linear programming model is to:

Since all linear programming models must contain nonnegativity constraints,Solver will automatically include them and it is not necessary to add them to a formulation.

The operations manager for the Blue Moon Brewing Co. produces two beers: Lite (L) and Dark (D) . He can only get 675 gallons of malt extract per day for brewing and his brewing hours are limited to 8 hours per day. To produce a keg of Lite beer requires 2 minutes of time and 5 gallons of malt extract. 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?

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

A local bagel shop produces 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 baking. Bagel profits are 20 cents each and croissant profits are 30 cents each. -What is the sugar constraint?

A feasible solution is one that satisfies all the constraints of a linear programming problem simultaneously.

The feasible region only contains points that satisfy all constraints.

A linear programming problem can have multiple optimal solutions.

Linear programming allows a manager to find the best mix of activities to pursue and at what levels.

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) .There are at most 12 hours per day of production time and 1500 gallons per day of carbonated water available.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 is the daily profit when producing the optimal amounts?

The best feasible solution is called the optimal solution.

The owner of Crackers, Inc. produces both Deluxe (D) and Classic (C) crackers. She only has 4,800 ounces of sugar, 9,600 ounces of flour, and 2,000 ounces of salt for her next production run. A box of Deluxe crackers requires 2 ounces of sugar, 6 ounces of flour, and 1 ounce of salt to produce. A box of Classic crackers requires 3 ounces of sugar, 8 ounces of flour, and 2 ounces of salt to produce. Profits are 40 cents for a box of Deluxe crackers and 50 cents for a box of Classic crackers. -What is the objective function?