06_Special Cases LP Flashcards

1
Q

Which special cases can occur during Simplex?

6 items

A
  • No feasible solution
  • unbounded solution
  • redundant constraints
  • primal degeneracy
  • dual degeneracy
  • multiple optimal solutions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How to detect Primal Degeneracy?

A
  • RHS = 0 of BV
  • Simplex might get stuck at a corner point and won’t return optimal solution [cycling]
  • corner point is overdetermined
  • can also include dual degerenacy if NBV has coefficient 0 in objective function
  • NBV with +1 in constraint and all other 0 could be added into basis without changing objective function
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How to detect Dual Degeneracy

A
  • NBV has coefficient of 0 in the optimal objective function
  • when there is primal degeneracy -> RHS = 0 of basic variable in one constraint
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are special cases in context of Simplex?

A
  • Primal / Dual Degeneracy
  • Unbounded Solution
  • No Feasible Solution
  • Redundant Constraint
  • Multiple Optimal Solutions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Multiple Solutions

A
  • objective functions and constraint share same slope
  • simplex will return NBV with c(j) = 0 in objective function -> Dual Degeneracy
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Unbounded Solution

A
  • objective function can increase indefinitely
  • maximizing objective function
  • all constraint >= 0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Redundant constraint

A
  • simplex will return **slack variable **of redundant constraint that is always > 0 **and thus in the basis **
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How to detect No feasible solution?

A
  • Big - M Method will return optimal solution
  • but: artificial variable is still in basis
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What causes Dual Degeneracy

A
  • multiple optimal solustions
  • when objective function and constraint have the same slope
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What causes Redundant Constraints?

A
  • constraint doesn’t add new information
  • Slack variable associated with redundant constraint will always be > 0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

How to detect unbounded solution in tableau?

A
  • all coefficients in the pivot column will possess a value of smaller or equal 0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How to detect
Redundant constraints in tableau?

A
  • Any tableau has 2 „non-basic rows“ that are multiples of each other
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How to detect Primal Degeneracy

with primal simplex

A

Any tableau has a basis variable with RHS = 0

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

How to detect Dual Degeneracy

with Primal Simplex

A
  • Optimal Tableau has a non-basic variable with last row-coefficient 0
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

How to detect non-feasible solution

A

Big M-Method:
- artificial variable in the basis of the optimal tableau

Two-Phase Method:
- Phase 1 finished with objective function value > 0

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

Effect of Primal Degeneracyon Simplex Algorithm

A
  • pivot step without changing the objective function value is conducted.
  • simplex might get stuck at overdetermined corner point (cycling) and might won’t return optimal solution
17
Q

Effect of Multiple optimal solutions on Simplex Algorithm

A
  • NBV has coefficient of 0 in objective function
  • Simplex will stop at one possible optimal solution
18
Q

Effect of Unboundness on Simplex Algorithm

A
  • as all column entries in pivot column are negative
  • simplex will stop and won’t return result
19
Q

Effect of non-feasible solution on Simplex Algorithm

A
  • Canonical start form is technically optimal (i.e. all coefficients in objective function row ≤ 0)
  • **simplex terminates as artifical variable is still in basis **