Chapter 3 Flashcards

1
Q

Sensitivity Analysis

A

study of how changes in coefficients of optimization model (min or max) affect optimal solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What do we want to determine with sensitivity analysis?

A

How much these changes will affect optimal solution of LPM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Two questions answered with sensitivity analysis

A

how will change in coefficient of objective function affect optimal solution?
how will change in right side value of constraint affect optimal solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Feasible solution satisfies all….

A

solution that satisfies all constraints

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

feasible set or region

A

set of all feasible solutions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Optimal solution

A

feasible solution that produces the best objective function of all feasible solutions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

When does sensitivity analysis begin

A

after original optimal solution of LP model is estalished

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

sensitivity analysis is also known as

A

post-optimality analysis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Binding constraints

A

constraints satisfied exactly at optimal solution, S=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Binding constraints are constraints whose intersection…….

A

determines optimal solution to LP Model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Non binding constraints

A

constraints that are satisfied at the optimal solution but have surplus -S and slack +S whose value is not zero

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Range of optimality

A

range of values for each variable of objection function coefficient which current solution will remain optimal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Range of optimality changes to variables at a time

A

only one variable coefficient change at a time

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Does increase or decrease of a objection function coefficient change the values of decision variables in optimal solution

A

no they cannot if in optimal range

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what if coefficient change for objection function is outside range

A

Manage will have to resolve linear program model, change should not be allowed, would result in new optimal solution, cannot guarantee optimality for other variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Shadow price

A

amount by which optimal objection value will change if right hand side of constraint is increase or decreased by one unit

17
Q

Other terms for Shadow Price

A

marginal value or dual price

18
Q

Shadow price is equal to

A

different in values of objective function between new and original problem

19
Q

Shadow price for non-binding constraint is….

A

zero

20
Q

negative shadow price indicates

A

objective function will not improve if RHS is increased

21
Q

Range of Feasibility

A

range of values over which a right hand side value may vary without changing the value and interpretation of shadow price

22
Q

Any change to right hand side of binding constraint will……

A

change the optimal solution

23
Q

Any change to right hand side of non-binding constraint that is less than slack or surplus will……

A

will cause no change to optimal solution as S is zero

24
Q

Reduced Cost

A

minimum amount by which objective coefficient of a variable should change in order to affect optimal solution

25
Q

Case Maximization: If reduced cost is < 0

A

cost of consumed is higher than profit, activity should not be undertaken

25
Q

Case maximization: Reduced cost =

A

per unit profit of activity - cost of consumed resource per activity
* per unit of resource is priced at shadow price

26
Q

Case Maximization: if reduced cost >= 0

A

cost of consumed is lower/equal to profit, activity is economically attractive

27
Q

Case minimization: Reduced cost =

A

per unit cost of activity - cost of consumed resource per activity
* per unit of resource is priced at shadow price

28
Q

Case Minimization: If reduced cost is > 0

A

cost of consumed is higher than cost of activity so it should not be undertaken

29
Q

Case Minimization: If reduced cost is <= 0

A

cost of consumed is lower than or equal to cost of activity is economically attractive

30
Q

Variable value increase indication of worse objective value.
- Maximization
- Minimization

A

Maximization: R is negative and objective decrease
Minimization: R is Positive and objective increase