Exam 2: Linear programming: Basic Concepts

If a single optimal solution exists while using the graphical method to solve a linear programming problem,it will exist at a corner point

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?

What is the optimal solution for the following problem?

The operations manager of a mail order house purchases double (D) and twin (T) beds for resale. Each double bed costs $500 and requires 100 cubic feet of storage space. Each twin 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 double bed is $300 and for each twin bed is $150. -What is the weekly profit when ordering the optimal amounts?

For a graph where the horizontal axis represents the variable x and the vertical axis represents the variable y,the slope of a line is the change in y when x is increased by 1

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?

One of the great strengths of spreadsheets is their flexibility for dealing with a wide variety of problems

When formulating a linear programming problem on a spreadsheet,the Excel equation for each output cell can typically be expressed as a SUMPRODUCT function

When using the graphical method,the region that satisfies all of the constraints of a linear programming problem is called the:

In linear programming,solutions that satisfy all of the constraints simultaneously are referred to as:

What is the constraint for Colombian beans?

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

An example of a decision variable in a linear programming problem is profit maximization

The operations manager of a mail order house purchases double (D) and twin (T) beds for resale. Each double bed costs $500 and requires 100 cubic feet of storage space. Each twin 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 double bed is $300 and for each twin bed is $150. -What is the 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?

The origin satisfies any constraint with a ≥ sign and a positive right-hand side

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

What is the optimal solution for the following problem?

What is the objective function?

Where is the objective cell located?