Exam 3: Linear Programming: Formulation and Applications

Explore all topics

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

(True/False)

4.7/5

(37)

Question 21

A linear programming model contains which of the following components?

(Multiple Choice)

4.9/5

(35)

Question 22

Which of the following are categories of linear programming problems?

(Multiple Choice)

4.8/5

(31)

Question 23

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

(True/False)

4.9/5

(44)

Question 24

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

(True/False)

4.7/5

(35)

Question 25

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

(True/False)

4.8/5

(37)

Question 26

It is usually quite simple to obtain estimates of parameters in a linear programming problem.

(True/False)

4.9/5

(31)

Question 27

A benefit constraint refers to a functional constraint with a $\ge$ sign in a linear programming model.

(True/False)

4.8/5

(39)

Question 28

Having one requirement for each location is a characteristic common to all transportation problems.

(True/False)

4.9/5

(33)

Question 29

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

(True/False)

4.7/5

(27)

Question 30

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

(True/False)

4.7/5

(38)

Question 31

Resource-allocation problems have the following type of constraints:

(Multiple Choice)

4.7/5

(33)

Question 32

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

(Multiple Choice)

4.8/5

(38)

Question 33

When formulating a linear programming model on a spreadsheet,the constraints are located (in part)in the output cells.

(True/False)

4.7/5

(39)

Question 34

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

(True/False)

4.9/5

(35)

Question 35

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

(True/False)

4.9/5

(45)

Question 36

The target cell is a special kind of output cell.

(True/False)

4.9/5

(32)

Question 37

Fixed-requirement constraints in a linear programming model are functional constraints that use an equal sign.

(True/False)

4.8/5

(31)

Question 38

A resource constraint refers to any functional constraint with a $\ge$ sign in a linear programming model.

(True/False)

4.9/5

(39)

Question 39

An assignment problem is a special type of transportation problem

(True/False)

4.8/5

(26)

Question 40

Showing 21 - 40 of 58

Exam 3: Linear Programming: Formulation and Applications

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

A linear programming model contains which of the following components?

Which of the following are categories of linear programming problems?

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

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

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

It is usually quite simple to obtain estimates of parameters in a linear programming problem.

A benefit constraint refers to a functional constraint with a ≥\ge≥ sign in a linear programming model.

Having one requirement for each location is a characteristic common to all transportation problems.

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

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

Resource-allocation problems have the following type of constraints:

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

When formulating a linear programming model on a spreadsheet,the constraints are located (in part)in the output cells.

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

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

The target cell is a special kind of output cell.

Fixed-requirement constraints in a linear programming model are functional constraints that use an equal sign.

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

An assignment problem is a special type of transportation 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

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

A benefit constraint refers to a functional constraint with a $\ge$ sign in a linear programming model.

A resource constraint refers to any functional constraint with a $\ge$ sign in a linear programming model.