Return to Index
Operations Research Models and Methods
 


Tours

 

Linear Programming (LP) Tour

2 Linear Programming Models

  • 2.1 A Manufacturing Example
  • 2.2 Computational Considerations
  • 2.3 Terminology
  • 2.4 Solution Characteristics
  • 2.5 Solutions and Sensitivity Analysis
  • 2.6 Problem Classes
  • 2.7 Exercises
  • Bibliography

 

Supplements to Ch. 2
Linear Programming Models

  • Chemical Processing
  • Additional Exercises
  • Equivalent Linear Programs

Models
Linear Programming Models

Problems
Linear Programming Modeling Problems
Computation
Math Programming Add-in

3 Linear Programming Methods

  • 3.1 Standard Form of Model
  • 3.2 Preparing the Model
  • 3.3 Geometric Properties of a Linear Program
  • 3.4 Simplex Tableau
  • 3.5 Information from the Simplex Form
  • 3.6 Simplex Method Using Tableaus
  • 3.7 Special Situations
  • 3.8 The Initial Basic Feasible Solution
  • 3.9 Dual Simplex Algorithm
  • 3.10 Simplex Method Using Matrix Notation
  • 3.11 Revised Simplex Method
  • 3.12 Exercises
  • Bibliography

 

Supplements to Ch. 3
Linear Programming Methods

  • Additional Exercises

4 Sensitivity Analysis, Duality, and Interior Point Methods

  • 4.1 Sensitivity Analysis
  • 4.2 The Dual Linear Program
  • 4.3 Interior Point Methods
  • 4.4 Exercises
  • Bibliography

 

Supplements to Ch. 4
Sensitivity Analysis, Duality, and Interior Point Methods

  • Additional Exercises

Methods
Linear Programming

Computation
LP/IP Solver Add-in
mp_models.xla Math Programming
lpip_solver.xla LP/IP Solver
teachlp.xla Teach Linear Programming
mpdem.xls Math Programming
teachlpdem.xls Teach LP

 

 

  
Return to Top

Operations Research Models and Methods
Internet
by Paul A. Jensen
Copyright 2004 - All rights reserved