Question 1

The line forming the boundary of what is permitted by a constraint is referred to as a parameter

Accepted Answer

A) True 
 B)False

Question 2

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

Accepted Answer

A) (A,
B) = (0,0) 
B) (A,
B) = (0,1000) 
C) (A,
B) = (1800,700) 
D) (A,
B) = (2500,0) 
E) (A,
B) = (100,1600) 
A) (A,
B) = (0,0) 
B) (A,
B) = (0,1000) 
C) (A,
B) = (1800,700) 
D) (A,
B) = (2500,0) 
E) (A,
B) = (100,1600)

Question 3

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?

Accepted Answer

A) P = 0 5D + 0 4C 
B) P =0 2D + 0 3C 
C) P = 0 4D + 0 5C 
D) P = 0 1D + 0 2C 
E) P =0 6D + 0 8C 
A) P = 0 5D + 0 4C 
B) P =0 2D + 0 3C 
C) P = 0 4D + 0 5C 
D) P = 0 1D + 0 2C 
E) P =0 6D + 0 8C

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

A) identify the decision variables 
B) identify the objective function 
C) identify the constraints 
D) specify the parameters of the problem 
E) None of the above 
A) identify the decision variables 
B) identify the objective function 
C) identify the constraints 
D) specify the parameters of the problem 
E) None of the above

Question 6

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 7

The feasible region only contains points that satisfy all constraints

Accepted Answer

A) True 
 B)False

Question 8

An infeasible solution violates all of the constraints of the problem

Accepted Answer

A) True 
 B)False

Question 9

The best feasible solution is called the optimal solution

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

Solving linear programming problems graphically,

Accepted Answer

A) is possible with any number of decision variables 
B) provides geometric intuition about what linear programming is trying to achieve 
C) will always result in an optimal solution 
D) All of the above 
E) None of the above 
A) is possible with any number of decision variables 
B) provides geometric intuition about what linear programming is trying to achieve 
C) will always result in an optimal solution 
D) All of the above 
E) None of the above

Question 12

When formulating a linear programming problem on a spreadsheet,which of the following is true?

Accepted Answer

A) Parameters are called data cells 
B) Decision variables are called changing cells 
C) Nonnegativity constraints must be included 
D) The objective function is called the objective cell 
E) All of the above 
A) Parameters are called data cells 
B) Decision variables are called changing cells 
C) Nonnegativity constraints must be included 
D) The objective function is called the objective cell 
E) All of the above

Question 13

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible

Accepted Answer

A) True 
 B)False

Question 14

Linear programming problems always involve either maximizing or minimizing an objective function

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A) (B,
C) = (0,0) 
B) (B,
C) = (0,1100) 
C) (B,
C) = (800,600) 
D) (B,
C) = (1100,0) 
E) (B,
C) = (0,1400) 
A) (B,
C) = (0,0) 
B) (B,
C) = (0,1100) 
C) (B,
C) = (800,600) 
D) (B,
C) = (1100,0) 
E) (B,
C) = (0,1400)

Question 16

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?

Accepted Answer

A) $0 
B) $240 
C) $420 
D) $405 
E) $505 
A) $0 
B) $240 
C) $420 
D) $405 
E) $505

Question 17

Which of the following is not a feasible solution?

Accepted Answer

A) (A,
B) = (0,0) 
B) (A,
B) = (0,400) 
C) (A,
B) = (200,300) 
D) (A,
B) = (400,0) 
E) (A,
B) = (400,400) 
A) (A,
B) = (0,0) 
B) (A,
B) = (0,400) 
C) (A,
B) = (200,300) 
D) (A,
B) = (400,0) 
E) (A,
B) = (400,400)

Question 18

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

Accepted Answer

A) True 
 B)False

Question 19

Constraints limit the alternatives available to a decision-maker

Accepted Answer

A) True 
 B)False

Question 20

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

Accepted Answer

A) 2R +3S ≤ 720 
B) 2R + 5S ≤ 720 
C) 3R + 2S ≤ 720 
D) 3R + 5S ≤ 720 
E) 5R + 5S ≤ 720 
A) 2R +3S ≤ 720 
B) 2R + 5S ≤ 720 
C) 3R + 2S ≤ 720 
D) 3R + 5S ≤ 720 
E) 5R + 5S ≤ 720

The line forming the boundary of what is permitted by a constraint is referred to as a parameter

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

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

Where are the changing cells located?

The feasible region only contains points that satisfy all constraints

An infeasible solution violates all of the constraints of the problem

The best feasible solution is called the optimal solution

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

Solving linear programming problems graphically,

When formulating a linear programming problem on a spreadsheet,which of the following is true?

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible

Linear programming problems always involve either maximizing or minimizing an objective function

Which of the following is not a feasible solution?

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

Constraints limit the alternatives available to a decision-maker

Introduction

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

Exam 2: Linear programming: Basic Concepts

The line forming the boundary of what is permitted by a constraint is referred to as a parameter

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

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

Where are the changing cells located?

The feasible region only contains points that satisfy all constraints

An infeasible solution violates all of the constraints of the problem

The best feasible solution is called the optimal solution

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

Solving linear programming problems graphically,

When formulating a linear programming problem on a spreadsheet,which of the following is true?

When solving a minimization problem graphically,it is generally the goal to move the objective function line out,away from the origin,as far as possible

Linear programming problems always involve either maximizing or minimizing an objective function

Which of the following is not a feasible solution?

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

Constraints limit the alternatives available to a decision-maker

Introduction

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Network optimization problems

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters