Question 1

In linear programming formulations, it is possible to have the following types of constraints:

Accepted Answer

A)  ≤. 
B)  >. 
C)  =. 
D)  ≤ and > only. 
E)  All of the answer choices are correct. 
A)  ≤. 
B)  >. 
C)  =. 
D)  ≤ and > only. 
E)  All of the answer choices are correct.

Question 2

A grocery store manager must decide how to best present a limited supply of milk and cookies to its customers. Milk can be sold by itself for a profit of $1.50 per gallon. Cookies can likewise be sold at a profit of $2.50 per dozen. To increase appeal to customers, one gallon of milk and a dozen cookies can be packaged together and are then sold for a profit of $3.00 per bundle. The manager has 100 gallons of milk and 150 dozen cookies available each day. The manager has decided to stock at least 75 gallons of milk per day and demand for cookies is always 140 dozen per day. To maximize profits, how much of each product should the manager stock.
What is the maximum daily profit that the grocery store can achieve?

Accepted Answer

A)  $515 
B)  $485 
C)  $455 
D)  $425 
E)  $395 
A)  $515 
B)  $485 
C)  $455 
D)  $425 
E)  $395

Question 3

Where are the output cells located?

Accepted Answer

A)  B2:D2 
B)  B2:D2, B4:D7, and G5:G7 
C)  B10:D10 
D)  E5:E7 
E)  G10 
A)  B2:D2 
B)  B2:D2, B4:D7, and G5:G7 
C)  B10:D10 
D)  E5:E7 
E)  G10

Question 4

Transportation and assignment problems are examples of fixed-requirement problems.

Accepted Answer

A) True 
 B)False

Question 5

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)  Right hand sides are part of the constraints. 
D)  The objective function is called the objective cell. 
E)  All of the answer choices are correct. 
A)  Parameters are called data cells. 
B)  Decision variables are called changing cells. 
C)  Right hand sides are part of the constraints. 
D)  The objective function is called the objective cell. 
E)  All of the answer choices are correct.

Question 6

Using techniques to test the initial versions of a model to identify errors and omissions is called:

Accepted Answer

A)  model validation. 
B)  model enrichment. 
C)  model enhancement. 
D)  model debugging. 
E)  None of the answer choices are correct. 
A)  model validation. 
B)  model enrichment. 
C)  model enhancement. 
D)  model debugging. 
E)  None of the answer choices are correct.

Question 7

Mixed problems may have the following type of constraints:

Accepted Answer

A)  ≥. 
B)  ≤. 
C)  =. 
D)  All of the answer choices are correct. 
E)  None of the answer choices are correct. 
A)  ≥. 
B)  ≤. 
C)  =. 
D)  All of the answer choices are correct. 
E)  None of the answer choices are correct.

Question 8

Starting with a simple version of a model and adding to it until it reflects the real problem is called:

Accepted Answer

A)  model validation. 
B)  model enrichment. 
C)  model enhancement. 
D)  model elaboration. 
E)  None of the answer choices are correct. 
A)  model validation. 
B)  model enrichment. 
C)  model enhancement. 
D)  model elaboration. 
E)  None of the answer choices are correct.

Question 9

When formulating a transportation problem on a spreadsheet, which of the following are necessary?

Accepted Answer

A)  A table of data. 
B)  A network representation. 
C)  A table for the solution. 
D)  A table of data and a table for the solution only. 
E)  All of the answer choices are correct. 
A)  A table of data. 
B)  A network representation. 
C)  A table for the solution. 
D)  A table of data and a table for the solution only. 
E)  All of the answer choices are correct.

Question 10

Where are the changing cells located?

Accepted Answer

A)  B2:D2 
B)  B2:D2, B4:D7, and G5:G7 
C)  B10:D10 
D)  E5:E7 
E)  G10 
A)  B2:D2 
B)  B2:D2, B4:D7, and G5:G7 
C)  B10:D10 
D)  E5:E7 
E)  G10

Question 11

In a cost-benefit-trade-off problem, management defines the maximum amount that can be spent and the objective is to maximize benefits within this cost target.

Accepted Answer

A) True 
 B)False

Question 12

Model formulation should precede problem formulation.

Accepted Answer

A) True 
 B)False

Question 13

A transportation problem requires a unit cost for every source-destination combination.

Accepted Answer

A) True 
 B)False

Question 14

A freelance writer must choose how to spend her time working on several different types of projects.
Newspaper stories take 3 hours to write and pay a flat rate of $45 per story. Magazine articles take much longer to write (25 hours) but pay significantly better ($400 per article). Proofreading is often tedious, but the writer can always find proofreading jobs that pay $20 per hour. The writer wants to maximize her income, but doesn't want to work more than 45 hours per week. Additionally, she dislikes proofreading so she would like to spend no more than 7 hours per week on that task. Both newspaper stories and magazine articles must be completed in the week they are started (HINT: use an integer constraint to be sure that all newspaper and magazine jobs are finished within a week).
The writer's problem falls within which classification?

Accepted Answer

A)  Resource-allocation. 
B)  Cost-benefit-trade-off. 
C)  Mixed problems. 
D)  Transportation problems. 
E)  Assignment problems. 
A)  Resource-allocation. 
B)  Cost-benefit-trade-off. 
C)  Mixed problems. 
D)  Transportation problems. 
E)  Assignment problems.

Question 15

Generally, assignment problems match people to an equal number of tasks at a minimum cost.

Accepted Answer

A) True 
 B)False

Question 16

In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource usage per unit of the corresponding activity.

Accepted Answer

A) True 
 B)False

Question 17

When dealing with huge real problems, there is no such thing as the perfectly correct linear programming model for the problem.

Accepted Answer

A) True 
 B)False

Question 18

Blending problems are a special type of mixed linear programming problems.

Accepted Answer

A) True 
 B)False

Question 19

A grocery store manager must decide how to best present a limited supply of milk and cookies to its customers. Milk can be sold by itself for a profit of $1.50 per gallon. Cookies can likewise be sold at a profit of $2.50 per dozen. To increase appeal to customers, one gallon of milk and a dozen cookies can be packaged together and are then sold for a profit of $3.00 per bundle. The manager has 100 gallons of milk and 150 dozen cookies available each day. The manager has decided to stock at least 75 gallons of milk per day and demand for cookies is always 140 dozen per day. To maximize profits, how much of each product should the manager stock.
Which of the following is the constraint that limits the amount of milk the store will use (both in bundles and sold separately) each day?

Accepted Answer

A)  M + B ≥ 100 
B)  M + B ≤ 100 
C)  M + B ≥ 75 
D)  M + B ≤ 75 
E)  M ≤ 100 
A)  M + B ≥ 100 
B)  M + B ≤ 100 
C)  M + B ≥ 75 
D)  M + B ≤ 75 
E)  M ≤ 100

Question 20

A mixed linear programming problem will always contain some of each of the three types of constraints in it.

Accepted Answer

A) True 
 B)False

In linear programming formulations, it is possible to have the following types of constraints:

Where are the output cells located?

Transportation and assignment problems are examples of fixed-requirement problems.

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

Using techniques to test the initial versions of a model to identify errors and omissions is called:

Mixed problems may have the following type of constraints:

Starting with a simple version of a model and adding to it until it reflects the real problem is called:

When formulating a transportation problem on a spreadsheet, which of the following are necessary?

Where are the changing cells located?

In a cost-benefit-trade-off problem, management defines the maximum amount that can be spent and the objective is to maximize benefits within this cost target.

Model formulation should precede problem formulation.

A transportation problem requires a unit cost for every source-destination combination.

Generally, assignment problems match people to an equal number of tasks at a minimum cost.

In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource usage per unit of the corresponding activity.

When dealing with huge real problems, there is no such thing as the perfectly correct linear programming model for the problem.

Blending problems are a special type of mixed linear programming problems.

A mixed linear programming problem will always contain some of each of the three types of constraints in it.

Introduction

Linear Programming: Basic Concepts

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

Forecasting

Queueing Models

Computer Simulation: Basic Concepts

Computer Simulation With Analytic Solver

Filters

Exam 3: Linear Programming: Formulation and Applications

In linear programming formulations, it is possible to have the following types of constraints:

Where are the output cells located?

Transportation and assignment problems are examples of fixed-requirement problems.

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

Using techniques to test the initial versions of a model to identify errors and omissions is called:

Mixed problems may have the following type of constraints:

Starting with a simple version of a model and adding to it until it reflects the real problem is called:

When formulating a transportation problem on a spreadsheet, which of the following are necessary?

Where are the changing cells located?

In a cost-benefit-trade-off problem, management defines the maximum amount that can be spent and the objective is to maximize benefits within this cost target.

Model formulation should precede problem formulation.

A transportation problem requires a unit cost for every source-destination combination.

Generally, assignment problems match people to an equal number of tasks at a minimum cost.

In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource usage per unit of the corresponding activity.

When dealing with huge real problems, there is no such thing as the perfectly correct linear programming model for the problem.

Blending problems are a special type of mixed linear programming problems.

A mixed linear programming problem will always contain some of each of the three types of constraints in it.

Introduction

Linear Programming: Basic Concepts

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

Forecasting

Queueing Models

Computer Simulation: Basic Concepts

Computer Simulation With Analytic Solver

Filters