Overview of Week 8
Math 407 Section A, November 12, 2012
-
Reading Assignment:
- Course notes:Section 5: pages 1-9:
Due Wednesday, Nov 7.
- Course notes:Section 5: pages 9-17:
Due Friday, Nov 9.
- Course notes:Section 6: pages 1-5:
Due Friday, Nov 16.
- Course notes:Section 6: pages 5-11:
Due Monday, Nov 19.
- Course notes:Section 6: pages 11-13:
Due Wednesday, Nov 21.
- Course notes:Section 6: pages 13-14:
Due Monday, Nov 26.
-
Homework Assignment:
-
Vocabulary List:
- Section 4:
- the dual LP to an LP in standard form
- Statement and proof of the Weak Duality Theorem for LP
(as stated in the notes, not as stated in the book)
- What is the structure of both the initial and
the optimal dictionaries, and why does the optimal dictionary
have this structure?
- What is the block structure of both the initial and
the optimal tableaus, and why does the optimal tableau
have this structure?
- How do you read off the optimal solutions for both the
primal and dual problems from the optimal tableau or dictionary?
- The block structured matrix interpretation of simplex pivoting
- Statement and proof of the Strong Duality Theorem
- all relationships between primal and dual problems
- The Complementary Slackness Theorem
- State the primal and dual problems for the more general
standard form.
- What are the primal and dual correspondences between the
primal and dual in the more general standard form?
- State and prove the weak Duality theorem for the more general
standard form.
- primal and dual feasible tableaus and dictionaries
- primal simplex pivot
- dual simplex pivot
- dual simplex algorithm
- primal degeneracy and dual degeneracy
- Section 5:
- hyperplane
- halfspace
- convex set
- polyhedral convex set
- vertex of a polyhedral convex set
- geometric interpretation of Basic Feasible Solutions
- geometric interpretation of Degeneracy
- geometric interpretation of Duality
- Fundamental representation theorem for vertices.
- The geometry of degeneracy.
- the relationship between primal (dual) degeneracy and
multiple optimal solutions to the (dual) primal problem.
- The Geometric Duality Theorem.
- Section 6:
- The block structured matrix interpretation of simplex pivoting
- tableau approach to sensitivity analysis (block matrix structure)
- break-even price
- reduced cost
- marginal values
- shadow prices
- objective coefficient range
- right hand side (or resource) range
- pricing out
- the fundamental theorem on sensitivity analysis
-
Key Concepts:
- Section 4:
- The Strong Duality Theorem
- Complementary slackness
- general duality correspondences
- primal and dual feasibility for tableaus and dictionaries
- the dual simplex algorithm
- Section 5:
- vertices and BFSs
- geometry of duality
- geometry of degeneracy
- degeneracy and multiple optimal solutions
- Section 6:
- tableau approach to sensitivity analysis
- Range analysis (cost coefficients and right hand sides)
- Pricing out
-
Skills to Master:
- Apply the dual simplex algorithm
- apply the geometric duality theorem to test optimality
- computing break-even prices
- computing ranges (cost coefficients and right-hand sides)
-
Quiz:
Friday, November 16
- The first question quiz is based on the vocabulary words for
Section 5 of the notes or models 1-20. The second question
will ask you to apply
the Geometric Duality Theorem to determine whether a not a given vector
solves an LP in standard form. Sample problems of this type can be found
in the homework exercises under the
Geometric Duality heading.