Question 1

A circle would be an example of a feasible region for a linear programming problem.

Accepted Answer

A) True 
 B)False

Question 2

Which of the following is not a component of a linear programming model?

Accepted Answer

A) Constraints. 
B) Decision variables. 
C) Parameters. 
D) An objective. 
E) A spreadsheet. 
A) Constraints. 
B) Decision variables. 
C) Parameters. 
D) An objective. 
E) A spreadsheet.

Question 3

The equation 5x + 7y = 10 is linear.

Accepted Answer

A) True 
 B)False

Question 4

Which of the following constitutes a simultaneous solution to the following 2 equations?
(1))3x1 + 4x2 = 10
(2))5x1 + 4x2 = 14

Accepted Answer

A) (x1,x2 )= (2,0.5). 
B) (x1,x2 )= (4,0.5). 
C) (x1,x2 )= (2,1). 
D) x1 = x2. 
E) x2 = 2x1. 
A) (x1,x2 )= (2,0.5). 
B) (x1,x2 )= (4,0.5). 
C) (x1,x2 )= (2,1). 
D) x1 = x2. 
E) x2 = 2x1.

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

The production planner for Fine Coffees, Inc. produces two coffee blends: American (A) and British (B). He can only get 300 pounds of Colombian beans per week and 200 pounds of Dominican beans 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 constraint for Colombian beans?

Accepted Answer

A) A + 2B $\le$ 4,800. 
B) 12A + 8B $\le$ 4,800. 
C) 2A + B $\ge$ 4,800. 
D) 8A + 12B $\le$ 4,800. 
E) 4A + 8B $\le$ 4,800. 
A) A + 2B $\le$ 4,800. 
B) 12A + 8B $\le$ 4,800. 
C) 2A + B $\ge$ 4,800. 
D) 8A + 12B $\le$ 4,800. 
E) 4A + 8B $\le$ 4,800.

Question 7

An objective function represents a family of parallel lines.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

A) P = 2L + 3D. 
B) P = 2L + 4D. 
C) P = 3L + 2D. 
D) P = 4L + 2D. 
E) P = 5L + 3D. 
A) P = 2L + 3D. 
B) P = 2L + 4D. 
C) P = 3L + 2D. 
D) P = 4L + 2D. 
E) P = 5L + 3D.

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

The parameters of a model are the numbers in the data cells of a spreadsheet.

Accepted Answer

A) True 
 B)False

Question 11

Figure  
-Where are the changing cells located?

Accepted Answer

A) B2:C2. 
B) B2:C2,B5:C7,and F5:F7. 
C) B10:C10. 
D) F10. 
E) None of the above. 
A) B2:C2. 
B) B2:C2,B5:C7,and F5:F7. 
C) B10:C10. 
D) F10. 
E) None of the above.

Question 12

Constraints limit the alternatives available to a decision-maker.

Accepted Answer

A) True 
 B)False

Question 13

Figure  
-Where are the data cells located?

Accepted Answer

A) B2:C2. 
B) B2:C2,B5:C7,and F5:F7. 
C) B10:C10. 
D) F10. 
E) None of the above. 
A) B2:C2. 
B) B2:C2,B5:C7,and F5:F7. 
C) B10:C10. 
D) F10. 
E) None of the above.

Question 14

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

Accepted Answer

A) (R,S)= (0,0). 
B) (R,S)= (0,240). 
C) (R,S)= (180,120). 
D) (R,S)= (300,0). 
E) (R,S)= (180,240). 
A) (R,S)= (0,0). 
B) (R,S)= (0,240). 
C) (R,S)= (180,120). 
D) (R,S)= (300,0). 
E) (R,S)= (180,240).

Question 15

The production planner for Fine Coffees, Inc. produces two coffee blends: American (A) and British (B). He can only get 300 pounds of Colombian beans per week and 200 pounds of Dominican beans 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 constraint for Dominican beans?

Accepted Answer

A) 12A + 8B $\le$ 4,800. 
B) 8A + 12B $\le$ 4,800. 
C) 4A + 8B $\le$ 3,200. 
D) 8A + 4B $\le$ 3,200. 
E) 4A + 8B $\le$ 4,800. 
A) 12A + 8B $\le$ 4,800. 
B) 8A + 12B $\le$ 4,800. 
C) 4A + 8B $\le$ 3,200. 
D) 8A + 4B $\le$ 3,200. 
E) 4A + 8B $\le$ 4,800.

Question 16

The graphical method can handle problems that involve any number of decision variables.

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

A) 2D + 3C $\le$ 4,800. 
B) 6D + 8C $\le$ 4,800. 
C) 1D + 2C $\le$ 4,800. 
D) 3D + 2C $\le$ 4,800. 
E) 4D + 5C $\le$ 4,800. 
A) 2D + 3C $\le$ 4,800. 
B) 6D + 8C $\le$ 4,800. 
C) 1D + 2C $\le$ 4,800. 
D) 3D + 2C $\le$ 4,800. 
E) 4D + 5C $\le$ 4,800.

Question 18

The production planner for Fine Coffees, Inc. produces two coffee blends: American (A) and British (B). He can only get 300 pounds of Colombian beans per week and 200 pounds of Dominican beans 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 weekly profit when producing the optimal amounts?

Accepted Answer

A) $0. 
B) $400. 
C) $700. 
D) $800. 
E) $900. 
A) $0. 
B) $400. 
C) $700. 
D) $800. 
E) $900.

Question 19

Linear programming problems may have multiple goals or objectives specified.

Accepted Answer

A) True 
 B)False

Question 20

All constraints in a linear programming problem are either $\le$ or $\ge$ inequalities.

Accepted Answer

A) True 
 B)False

A circle would be an example of a feasible region for a linear programming problem.

Which of the following is not a component of a linear programming model?

The equation 5x + 7y = 10 is linear.

Which of the following constitutes a simultaneous solution to the following 2 equations? (1))3x₁ + 4x₂ = 10 (2))5x₁ + 4x₂ = 14

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

An objective function represents a family of parallel lines.

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

The parameters of a model are the numbers in the data cells of a spreadsheet.

Figure -Where are the changing cells located?

Constraints limit the alternatives available to a decision-maker.

Figure -Where are the data cells located?

The graphical method can handle problems that involve any number of decision variables.

Linear programming problems may have multiple goals or objectives specified.

All constraints in a linear programming problem are either $\le$ or $\ge$ inequalities.

Introduction

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Network Optimization Problems

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Transportation and Assignment Problems

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters

Exam 2: Linear Programming: Basic Concepts

A circle would be an example of a feasible region for a linear programming problem.

Which of the following is not a component of a linear programming model?

The equation 5x + 7y = 10 is linear.

Which of the following constitutes a simultaneous solution to the following 2 equations? (1))3x1 + 4x2 = 10 (2))5x1 + 4x2 = 14

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

An objective function represents a family of parallel lines.

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

The parameters of a model are the numbers in the data cells of a spreadsheet.

Figure -Where are the changing cells located?

Constraints limit the alternatives available to a decision-maker.

Figure -Where are the data cells located?

The graphical method can handle problems that involve any number of decision variables.

Linear programming problems may have multiple goals or objectives specified.

All constraints in a linear programming problem are either ≤\le≤ or ≥\ge≥ inequalities.

Introduction

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Network Optimization Problems

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Transportation and Assignment Problems

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters

Which of the following constitutes a simultaneous solution to the following 2 equations? (1))3x₁ + 4x₂ = 10 (2))5x₁ + 4x₂ = 14

All constraints in a linear programming problem are either $\le$ or $\ge$ inequalities.