Question 1

When formulating a linear programming problem on a spreadsheet, data cells will show the levels of activities for the decisions being made.

Accepted Answer

A) True 
 B)False

Question 2

Choosing the best tradeoff between cost and benefits is a managerial judgment decision.

Accepted Answer

A) True 
 B)False

Question 3

It is fairly common to have both resource constraints and benefit constraints in the same formulation.

Accepted Answer

A) True 
 B)False

Question 4

Where are data 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 5

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).
Which of the following is the constraint that limits the amount of time the writer will work each week?

Accepted Answer

A)  3N + 25M + P ≥ 45 
B)  3N + 25M + P ≤ 45 
C)  3N + 25M + P ≤ 7 
D)  45N + 400M + 20P ≤ 45 
E)  45N + 400M + 20P ≥ 45 
A)  3N + 25M + P ≥ 45 
B)  3N + 25M + P ≤ 45 
C)  3N + 25M + P ≤ 7 
D)  45N + 400M + 20P ≤ 45 
E)  45N + 400M + 20P ≥ 45

Question 6

Applications of assignment problems may include:

Accepted Answer

A)  matching personnel to jobs. 
B)  assigning machines to tasks. 
C)  designing bussing routes. 
D)  matching personnel to jobs and assigning machines to tasks only. 
E)  matching personnel to jobs, assigning machines to tasks, and designing bussing routes. 
A)  matching personnel to jobs. 
B)  assigning machines to tasks. 
C)  designing bussing routes. 
D)  matching personnel to jobs and assigning machines to tasks only. 
E)  matching personnel to jobs, assigning machines to tasks, and designing bussing routes.

Question 7

Strict inequalities (i.e., ) are not permitted in linear programming formulations.

Accepted Answer

A) True 
 B)False

Question 8

Cost-benefit tradeoff problems have the following type of constraints:

Accepted Answer

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

Question 9

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).
Which of the following is the objective function for the writer's problem?

Accepted Answer

A)  Max R = 45N + 400M − 20P 
B)  Min R = 3N + 25M + P 
C)  Max R = 45N + 400M + 20P 
D)  Min R = 3N + 25M + 20P 
E)  Max R = 3N + 400M + 20P 
A)  Max R = 45N + 400M − 20P 
B)  Min R = 3N + 25M + P 
C)  Max R = 45N + 400M + 20P 
D)  Min R = 3N + 25M + 20P 
E)  Max R = 3N + 400M + 20P

Question 10

A linear programming model contains which of the following components?

Accepted Answer

A)  Data. 
B)  Decisions. 
C)  Constraints. 
D)  Measure of performance. 
E)  All of the answer choices are correct. 
A)  Data. 
B)  Decisions. 
C)  Constraints. 
D)  Measure of performance. 
E)  All of the answer choices are correct.

Question 11

Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited resources to activities.

Accepted Answer

A) True 
 B)False

Question 12

Once a linear programming problem has been formulated, it is rare to make major adjustments to it.

Accepted Answer

A) True 
 B)False

Question 13

The transportation model method for evaluating location alternatives minimizes:

Accepted Answer

A)  the number of sources. 
B)  the number of destinations. 
C)  total supply. 
D)  total demand. 
E)  total shipping cost. 
A)  the number of sources. 
B)  the number of destinations. 
C)  total supply. 
D)  total demand. 
E)  total shipping cost.

Question 14

An assignment problem is a special type of transportation problem.

Accepted Answer

A) True 
 B)False

Question 15

In an assignment problem, it is necessary to add an integer constraint to the decision variables to ensure that they will take on a value of either 0 or 1.

Accepted Answer

A) True 
 B)False

Question 16

A mathematical model will be an exact representation of the real problem.

Accepted Answer

A) True 
 B)False

When formulating a linear programming problem on a spreadsheet, data cells will show the levels of activities for the decisions being made.

Choosing the best tradeoff between cost and benefits is a managerial judgment decision.

It is fairly common to have both resource constraints and benefit constraints in the same formulation.

Where are data cells located?

Applications of assignment problems may include:

Strict inequalities (i.e., < or >) are not permitted in linear programming formulations.

Cost-benefit tradeoff problems have the following type of constraints:

A linear programming model contains which of the following components?

Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited resources to activities.

Once a linear programming problem has been formulated, it is rare to make major adjustments to it.

The transportation model method for evaluating location alternatives minimizes:

An assignment problem is a special type of transportation problem.

In an assignment problem, it is necessary to add an integer constraint to the decision variables to ensure that they will take on a value of either 0 or 1.

A mathematical model will be an exact representation of the real problem.

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

When formulating a linear programming problem on a spreadsheet, data cells will show the levels of activities for the decisions being made.

Choosing the best tradeoff between cost and benefits is a managerial judgment decision.

It is fairly common to have both resource constraints and benefit constraints in the same formulation.

Where are data cells located?

Applications of assignment problems may include:

Strict inequalities (i.e., < or >) are not permitted in linear programming formulations.

Cost-benefit tradeoff problems have the following type of constraints:

A linear programming model contains which of the following components?

Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited resources to activities.

Once a linear programming problem has been formulated, it is rare to make major adjustments to it.

The transportation model method for evaluating location alternatives minimizes:

An assignment problem is a special type of transportation problem.

In an assignment problem, it is necessary to add an integer constraint to the decision variables to ensure that they will take on a value of either 0 or 1.

A mathematical model will be an exact representation of the real problem.

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