Question 1

Analytic Solver Platform provides sensitivity analysis information on all of the following except the

Accepted Answer

A)  range of values for objective function coefficients which do not change optimal solution. 
B)  impact on optimal objective function value of changes in constrained resources. 
C)  impact on optimal objective function value of changes in value of decision variables. 
D)  impact on right hand sides of changes in constraint coefficients. 
A)  range of values for objective function coefficients which do not change optimal solution. 
B)  impact on optimal objective function value of changes in constrained resources. 
C)  impact on optimal objective function value of changes in value of decision variables. 
D)  impact on right hand sides of changes in constraint coefficients.

Question 2

A binding less than or equal to (≤) constraint in a maximization problem means

Accepted Answer

A)  that all of the resource represented by the constraint is consumed in the solution. 
B)  it is not a constraint that the level curve contacts. 
C)  another constraint is limiting the solution. 
D)  the requirement for the constraint has been exceeded. 
A)  that all of the resource represented by the constraint is consumed in the solution. 
B)  it is not a constraint that the level curve contacts. 
C)  another constraint is limiting the solution. 
D)  the requirement for the constraint has been exceeded.

Question 3

Finding a robust solution to an LP problem

Accepted Answer

A)  is one of the many useful features of the Analytic Solver Platform 
B)  is trivial 
C)  is a guessing procedure 
D)  all of the above 
A)  is one of the many useful features of the Analytic Solver Platform 
B)  is trivial 
C)  is a guessing procedure 
D)  all of the above

Question 4

The solution to an LP problem is degenerate if

Accepted Answer

A)  the right hand sides of any of the constraints have an allowable increase or allowable decrease of zero. 
B)  the shadow prices of any of the constraints have an allowable increase or allowable decrease of infinity. 
C)  the objective coefficients of any of the variables have an allowable increase or allowable decrease of zero. 
D)  the shadow prices of any of the constraints have an allowable increase or allowable decrease of zero. 
A)  the right hand sides of any of the constraints have an allowable increase or allowable decrease of zero. 
B)  the shadow prices of any of the constraints have an allowable increase or allowable decrease of infinity. 
C)  the objective coefficients of any of the variables have an allowable increase or allowable decrease of zero. 
D)  the shadow prices of any of the constraints have an allowable increase or allowable decrease of zero.

Question 5

Use slack variables to rewrite this problem so that all its constraints are equality constraints.

Accepted Answer

The answer of Use slack variables to rewrite this problem...

Question 6

If the allowable increase for a constraint is 100 and we add 110 units of the resource what happens to the objective function value?

Accepted Answer

A)  increase of 100 
B)  increase of 110 
C)  decrease of 100 
D)  increases but by unknown amount 
A)  increase of 100 
B)  increase of 110 
C)  decrease of 100 
D)  increases but by unknown amount

Question 7

Exhibit 4.2
The following questions correspond to the problem below and associated Analytic Solver Platform sensitivity report.
Robert Hope received a welcome surprise in this management science class; the instructor has decided to let each person define the percentage contribution to their grade for each of the graded instruments used in the class. These instruments were: homework, an individual project, a mid-term exam, and a final exam. Robert's grades on these instruments were 75, 94, 85, and 92, respectively. However, the instructor complicated Robert's task somewhat by adding the following stipulations:   The following LP model allows Robert to maximize his numerical grade.    
-Refer to Exhibit 4.2. Based on the Analytic Solver Platform sensitivity report information, is there anything Robert can request of his instructor to improve his final grade?

Accepted Answer

Robert can request an increase

Question 8

The absolute value of the shadow price indicates the amount by which the objective function will be

Accepted Answer

A)  improved if the corresponding constraint is loosened. 
B)  improved if the corresponding constraint is tightened. 
C)  made worse if the corresponding constraint is loosened. 
D)  improved if the corresponding constraint is unchanged. 
A)  improved if the corresponding constraint is loosened. 
B)  improved if the corresponding constraint is tightened. 
C)  made worse if the corresponding constraint is loosened. 
D)  improved if the corresponding constraint is unchanged.

Question 9

The allowable decrease for a changing cell (decision variable) is

Accepted Answer

A)  the amount by which the constraint coefficient can decrease without changing final optimal solution. 
B)  an indication of how many more units to produce to maximize profits. 
C)  the amount by which objective function coefficient can decrease without changing the final optimal solution. 
D)  an indication of how much to charge to get the optimal solution. 
A)  the amount by which the constraint coefficient can decrease without changing final optimal solution. 
B)  an indication of how many more units to produce to maximize profits. 
C)  the amount by which objective function coefficient can decrease without changing the final optimal solution. 
D)  an indication of how much to charge to get the optimal solution.

Question 10

Jones Furniture Company produces beds and desks for college students. The production process requires carpentry and varnishing. Each bed requires 6 hours of carpentry and 4 hour of varnishing. Each desk requires 4 hours of carpentry and 8 hours of varnishing. There are 36 hours of carpentry time and 40 hours of varnishing time available. Beds generate $30 of profit and desks generate $40 of profit. Demand for desks is limited so at most 8 will be produced.
Suppose the company can purchase more varnishing time for $3.00, should it be purchased and how much can be bought before the value of the additional time is uncertain? Base your response on the following Analytic Solver Platform sensitivity output.   The LP model for the problem is   ​

Accepted Answer

Yes, because the cost of $3. 0

Question 11

The coefficients in an LP model (cj, aij, bj) represent

Accepted Answer

A)  random variables. 
B)  numeric constants. 
C)  random constants. 
D)  numeric variables. 
A)  random variables. 
B)  numeric constants. 
C)  random constants. 
D)  numeric variables.

Question 12

To convert ≤ constraints into = constraints the Simplex method adds what type of variable to the constraint?

Accepted Answer

A)  slack 
B)  dummy 
C)  redundant 
D)  spreading 
A)  slack 
B)  dummy 
C)  redundant 
D)  spreading

Question 13

The simplex method of linear programming (LP):

Accepted Answer

A)  moves to better and better corner point solution of the feasible region until no further objective function improvement can be achieved 
B)  explicitly enumerates all corner points of the feasible region and selects the best objective function value 
C)  evaluates all constraints for feasibility 
D)  does not covert all constraints to equalities 
A)  moves to better and better corner point solution of the feasible region until no further objective function improvement can be achieved 
B)  explicitly enumerates all corner points of the feasible region and selects the best objective function value 
C)  evaluates all constraints for feasibility 
D)  does not covert all constraints to equalities

Question 14

Constraint 3 is a non-binding constraint in the final solution to a maximization problem. Complete the following entry for the Analytic Solver Platform sensitivity report. Cell labels are included to ease of reference.

Accepted Answer

The answer of Constraint 3 is a non-binding constraint in...

Question 15

Slack variables

Accepted Answer

A)  are always equal to zero. 
B)  are usually negative. 
C)  are always positive. 
D)  can be positive or negative. 
A)  are always equal to zero. 
B)  are usually negative. 
C)  are always positive. 
D)  can be positive or negative.

Question 16

A formulation has 10 variables and 4 constraints (not counting non-negativity). How many variables are basic?

Accepted Answer

A)  4 
B)  10 
C)  14 
D)  6 
A)  4 
B)  10 
C)  14 
D)  6

Analytic Solver Platform provides sensitivity analysis information on all of the following except the

A binding less than or equal to (≤) constraint in a maximization problem means

Finding a robust solution to an LP problem

The solution to an LP problem is degenerate if

Use slack variables to rewrite this problem so that all its constraints are equality constraints.

If the allowable increase for a constraint is 100 and we add 110 units of the resource what happens to the objective function value?

The absolute value of the shadow price indicates the amount by which the objective function will be

The allowable decrease for a changing cell (decision variable) is

The coefficients in an LP model (c_j, a_ij, b_j) represent

To convert ≤ constraints into = constraints the Simplex method adds what type of variable to the constraint?

The simplex method of linear programming (LP):

Constraint 3 is a non-binding constraint in the final solution to a maximization problem. Complete the following entry for the Analytic Solver Platform sensitivity report. Cell labels are included to ease of reference.

Slack variables

A formulation has 10 variables and 4 constraints (not counting non-negativity). How many variables are basic?

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

Exam 4: Sensitivity Analysis and the Simplex Method

Analytic Solver Platform provides sensitivity analysis information on all of the following except the

A binding less than or equal to (≤) constraint in a maximization problem means

Finding a robust solution to an LP problem

The solution to an LP problem is degenerate if

Use slack variables to rewrite this problem so that all its constraints are equality constraints.

If the allowable increase for a constraint is 100 and we add 110 units of the resource what happens to the objective function value?

The absolute value of the shadow price indicates the amount by which the objective function will be

The allowable decrease for a changing cell (decision variable) is

The coefficients in an LP model (cj, aij, bj) represent

To convert ≤ constraints into = constraints the Simplex method adds what type of variable to the constraint?

The simplex method of linear programming (LP):

Constraint 3 is a non-binding constraint in the final solution to a maximization problem. Complete the following entry for the Analytic Solver Platform sensitivity report. Cell labels are included to ease of reference.

Slack variables

A formulation has 10 variables and 4 constraints (not counting non-negativity). How many variables are basic?

Introduction to Modeling and Decision Analysis

Introduction to Optimization and Linear Programming

Modeling and Solving Lp Problems in a Spreadsheet

Network Modeling

Integer Linear Programming

Goal Programming and Multiple Objective Optimization

Nonlinear Programming Evolutionary Optimization

Regression Analysis

Data Mining

Time Series Forecasting

Introduction to Simulation Using Analytic Solver Platform

Queuing Theory

Decision Analysis

Project Management Online

Filters

The coefficients in an LP model (c_j, a_ij, b_j) represent