Exam 5: What-If Analysis for Linear Programming

Explore all topics

When maximizing profit in a linear programming problem,the allowable increase and allowable decrease columns in the sensitivity report make it possible to find the range over which the profitability does not change.

(True/False)

4.9/5

(45)

Question 41

If the change to a right-hand side is within the allowable range,the value of the shadow price remains valid.

(True/False)

4.8/5

(42)

Question 42

Figure -What is the optimal objective function value for this problem?

(Multiple Choice)

4.9/5

(33)

Question 43

The allowable range for an objective function coefficient assumes that the original estimates for all the other coefficients are completely accurate so that this is the only one whose true value may differ from its original estimate.

(True/False)

4.8/5

(37)

Question 44

Solver Table can be used to investigate the changes in how many data cells at a time?

(Multiple Choice)

4.8/5

(31)

Question 45

If the sum of the percentage changes of the right-hand sides does not exceed 100%,then the solution will definitely remain optimal.

(True/False)

4.7/5

(29)

Question 46

Figure -What is entered as the row input cell in the Solver Table dialogue box?

(Multiple Choice)

4.8/5

(38)

Question 47

If the right-hand side of Resource B is increased by 30,and the right-hand side of Resource C is decreased by 10,then:

(Multiple Choice)

4.7/5

(40)

Question 48

Managerial decisions regarding right-hand sides are often interrelated and so frequently are considered simultaneously.

(True/False)

4.9/5

(34)

Question 49

When a change in the value of an objective function coefficient remains within the allowable range,the optimal solution will also remain the same.

(True/False)

4.9/5

(32)

Question 50

Figure -What is the allowable range of the right-hand-side for Resource A?

(Multiple Choice)

5.0/5

(24)

Question 51

If a change is made in only one of the objective function coefficients:

(Multiple Choice)

4.7/5

(35)

Question 52

If the coefficients of Activity 1 and Activity 2 in the objective function are both increased by $10,then:

(Multiple Choice)

4.7/5

(40)

Question 53

The purpose of a linear programming study is to help guide management's final decision by providing insights.

(True/False)

4.8/5

(35)

Question 54

If the right-hand side of Resource B changes to 10,then the objective function value:

(Multiple Choice)

4.8/5

(31)

Question 55

Which parameter is most sensitive to an increase in its value?

(Multiple Choice)

4.8/5

(29)

Question 56

A shadow price tells how much a decision variable can be increased or decreased without changing the value of the solution.

(True/False)

5.0/5

(28)

Question 57

Every change in the value of an objective function coefficient will lead to a changed optimal solution.

(True/False)

4.9/5

(33)

Question 58

If the right-hand side value of a constraint in a two variable linear programming problems is changed,then:

(Multiple Choice)

4.9/5

(35)

Question 59

The term "allowable range for an objective function coefficient" refers to a constraint's right-hand side quantity.

(True/False)

4.8/5

(29)

Question 60

Showing 41 - 60 of 63

Exam 5: What-If Analysis for Linear Programming

When maximizing profit in a linear programming problem,the allowable increase and allowable decrease columns in the sensitivity report make it possible to find the range over which the profitability does not change.

If the change to a right-hand side is within the allowable range,the value of the shadow price remains valid.

Figure -What is the optimal objective function value for this problem?

The allowable range for an objective function coefficient assumes that the original estimates for all the other coefficients are completely accurate so that this is the only one whose true value may differ from its original estimate.

Solver Table can be used to investigate the changes in how many data cells at a time?

If the sum of the percentage changes of the right-hand sides does not exceed 100%,then the solution will definitely remain optimal.

Figure -What is entered as the row input cell in the Solver Table dialogue box?

If the right-hand side of Resource B is increased by 30,and the right-hand side of Resource C is decreased by 10,then:

Managerial decisions regarding right-hand sides are often interrelated and so frequently are considered simultaneously.

When a change in the value of an objective function coefficient remains within the allowable range,the optimal solution will also remain the same.

Figure -What is the allowable range of the right-hand-side for Resource A?

If a change is made in only one of the objective function coefficients:

If the coefficients of Activity 1 and Activity 2 in the objective function are both increased by $10,then:

The purpose of a linear programming study is to help guide management's final decision by providing insights.

If the right-hand side of Resource B changes to 10,then the objective function value:

Which parameter is most sensitive to an increase in its value?

A shadow price tells how much a decision variable can be increased or decreased without changing the value of the solution.

Every change in the value of an objective function coefficient will lead to a changed optimal solution.

If the right-hand side value of a constraint in a two variable linear programming problems is changed,then:

The term "allowable range for an objective function coefficient" refers to a constraint's right-hand side quantity.

Introduction

Linear Programming: Basic Concepts

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

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