Question 1

Resource-allocation problems are linear programming problems involving the allocation of limited resources to activities

Accepted Answer

A) True 
 B)False

Question 2

Where is the objective cell 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 3

Transportation problems always involve shipping goods from one location to another

Accepted Answer

A) True 
 B)False

Question 4

When studying a resource-allocation problem,it is necessary to determine the contribution per unit of each activity to the overall measure of performance

Accepted Answer

A) True 
 B)False

Question 5

A key assumption of linear programming is that the equation for each of the output cells,including the objective cell,can be expressed as a SUMPRODUCT (or SUM)function

Accepted Answer

A) True 
 B)False

Question 6

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 7

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 8

It is the nature of the application that determines the classification of the resulting linear programming formulation

Accepted Answer

A) True 
 B)False

Question 9

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 above 
A) model validation 
B) model enrichment 
C) model enhancement 
D) model elaboration 
E) None of the above

Question 10

In most cases,the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much money is available

Accepted Answer

A) True 
 B)False

Question 11

When formulating a linear programming model on a spreadsheet,the measure of performance is located in the objective cell

Accepted Answer

A) True 
 B)False

Question 12

Which of the following are categories of linear programming problems?

Accepted Answer

A) Resource-allocation problems 
B) Cost-benefit-tradeoff problems 
C) Distribution-network problems 
D) All of the above 
E) None of the above 
A) Resource-allocation problems 
B) Cost-benefit-tradeoff problems 
C) Distribution-network problems 
D) All of the above 
E) None of the above

Question 13

Model formulation should precede problem formulation

Accepted Answer

A) True 
 B)False

Question 14

Approximations and simplifying assumptions generally are required to have a workable model

Accepted Answer

A) True 
 B)False

Question 15

A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model

Accepted Answer

A) True 
 B)False

Question 16

It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that determines the classification of the resulting linear programming formulation

Accepted Answer

A) True 
 B)False

Question 17

A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:

Accepted Answer

A) a resource-allocation problem 
B) a blending problem 
C) a cost-benefit tradeoff problem 
D) a mixture problem 
E) None of the above 
A) a resource-allocation problem 
B) a blending problem 
C) a cost-benefit tradeoff problem 
D) a mixture problem 
E) None of the above

Resource-allocation problems are linear programming problems involving the allocation of limited resources to activities

Where is the objective cell located?

Transportation problems always involve shipping goods from one location to another

When studying a resource-allocation problem,it is necessary to determine the contribution per unit of each activity to the overall measure of performance

A key assumption of linear programming is that the equation for each of the output cells,including the objective cell,can be expressed as a SUMPRODUCT (or SUM)function

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

Where are data cells located?

It is the nature of the application that determines the classification of the resulting linear programming formulation

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

In most cases,the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much money is available

When formulating a linear programming model on a spreadsheet,the measure of performance is located in the objective cell

Which of the following are categories of linear programming problems?

Model formulation should precede problem formulation

Approximations and simplifying assumptions generally are required to have a workable model

A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model

It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that determines the classification of the resulting linear programming formulation

A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:

Introduction

Linear programming: Basic Concepts

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 3: Linear programming: Formulation and applications

Resource-allocation problems are linear programming problems involving the allocation of limited resources to activities

Where is the objective cell located?

Transportation problems always involve shipping goods from one location to another

When studying a resource-allocation problem,it is necessary to determine the contribution per unit of each activity to the overall measure of performance

A key assumption of linear programming is that the equation for each of the output cells,including the objective cell,can be expressed as a SUMPRODUCT (or SUM)function

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

Where are data cells located?

It is the nature of the application that determines the classification of the resulting linear programming formulation

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

In most cases,the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much money is available

When formulating a linear programming model on a spreadsheet,the measure of performance is located in the objective cell

Which of the following are categories of linear programming problems?

Model formulation should precede problem formulation

Approximations and simplifying assumptions generally are required to have a workable model

A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model

It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that determines the classification of the resulting linear programming formulation

A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:

Introduction

Linear programming: Basic Concepts

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