56:270 Linear Programming Spring Semester 2000

The Hypercard stacks used in presentation of the lectures are available for downloading:

They are available as "PDF" (*.pdf) files, created by Adobe Acrobat. These can be read on either Macintosh, Windows, or Unix platforms, using the freely distributed Adobe Acrobat Reader. They are available in two versions: one with two cards per page (indicated by (2).pdf) and another with eight cards per page (indicated by (8).pdf).

List of Hypercard Stacks

• LP Overview (2).pdf
• Some preliminaries
  • Introduction to the APL Language (2).pdf or (8).pdf
  • Solving Systems of Linear Equations (2).pdf or (8).pdf
  • Convexity of Sets and Functions (2).pdf or (8).pdf
  • Taylor's Formula (2).pdf or (8).pdf
  • Newton's method (2).pdf or (8).pdf
• The Simplex Method & variations (edge-following algorithm)
  • Introduction to Simplex Method for LP (2).pdf or (8).pdf
  • The Simplex Method for LP (2).pdf or (8).pdf
  • Simplex Method: Getting the Initial Basic Feasible Solution (2).pdf or (8).pdf
  • Further Simplex Examples (2).pdf or (8).pdf
  • Revised Simplex Method (2).pdf or (8).pdf
  • Efficiency of Revised Simplex Method (2).pdf or (8).pdf
  • Upper Bounding Technique (2).pdf or (8).pdf
  • More examples of upper bounding technique (not Hypercard stacks): A, B, & C
• LP Duality (2).pdf or (8).pdf
• Dual Simplex Method (2).pdf or (8).pdf
• Farkas' Lemma (2).pdf or (8).pdf
• LP Questions & Answers (2).pdf or (8).pdf
• Linear Programming Models
  • Intro to Linear Programming Models (2).pdf or (8).pdf
  • More LP Formulations (2).pdf or (8).pdf
  • LP Application: Lizzie's Dairy (2).pdf or (8).pdf
  • LP Applications: Data Envelopment Analysis (DEA) (2).pdf or (8).pdf
  • Water Pipeline Network Design
    • LP formulation (2).pdf or (8).pdf
    • Solution by decomposition into subnetworks (2).pdf or (8).pdf
• LP Sensitivity Analysis
  • Part I (2).pdf or (8).pdf
  • Part II (2).pdf or (8).pdf
  • Parametric Programming on the RHS (2).pdf or (8).pdf
• Dantzig-Wolfe Decomposition of Large LP Problems
  • Theory (2).pdf or (8).pdf
  • Example (2).pdf or (8).pdf
• Multi-Objective Linear Programming (2).pdf or (8).pdf
• Transportation Problem (a specially-structured LP) (2).pdf or (8).pdf
• Stochastic Linear Programming
  • Stochastic LP with recourse (2-stage LP) (2).pdf or (8).pdf
  • Stochastic Transportation Problem (2).pdf or (8).pdf
  • Chance-constrained Stochastic LP (2).pdf or (8).pdf
• Markov Decision Processes (Optimization in a Markov chain)
  • Introduction (2).pdf or (8).pdf
  • LP algorithm (2).pdf or (8).pdf
  • Policy Improvement algorithm (2).pdf or (8).pdf
  • Examples
    • Batch processing (2).pdf or (8).pdf
    • Generator control (2).pdf or (8).pdf
    • Machine maintenance (2).pdf or (8).pdf
    • Production planning (2).pdf or (8).pdf
    • Replacement policies (2).pdf or (8).pdf
• Interior-point methods for LP
  • Complexity of Algorithms (2).pdf or (8).pdf
  • Penalty & Barrier Functions in Nonlinear Programming (2).pdf or (8).pdf
  • Newton's Method (2).pdf or (8).pdf
  • Path-following Algorithm for LP (2).pdf or (8).pdf
  • Example of Path-following Algorithm (2).pdf or (8).pdf
• Quadratic Programming
  • Quadratic Programming: Complementary Pivoting (2).pdf or (8).pdf
  • QP Solution by Complementary Pivoting: Example (2).pdf or (8).pdf
  • QP Application: Portfolio problem (2).pdf or (8).pdf
• Separable Programming (piecewise-linear programming)
  • Introduction (2).pdf or (8).pdf
  • Grid Refinement in Separable Programming (2).pdf or (8).pdf

to LP home page.

http://asrl.ecn.uiowa.edu/bricker/lp_stacks.html

Last modified: 22 March 2000