Linear Programming

Page last modified 18:25, 30 May 2010 by GJRoelofs | Page History

Description

This course deals with one specific mathematical model: the linear programming model. This model has a wide range of practical applications, and is of interest to practitioners in operations research, statistics, economics, management and psychology. This, and the fact that good algorithms can solve huge linear programs, is reason for the considerable succes of this model. The theory of the course treats the simplex algorithm, duality theory, and sensitivity analysis. Many examples from practice illustrate the power of the model and teach the student the skill of modelling. Computer sessions teach the student how to solve linear programs with Matlab.

Knowledge and understanding

Knowledge of the existing algorithms for linear programming.
Knowledge of the areas of application. Insight into duality theory, dual variables, sensitivity analysis.
The use of knowledge and insight: Formulate a practical problem as a linear programming problem, solve it with appropriate software, and interpret the results.

Making Judgements

 

Recognize when a problem is a linear programming problem.
Recognize sensitive data.

Communication

 

Communicate the results of software. Communicate why a chosen linear programming formulation correctly models a given problem.

Skills

 

Solve a small linear program by hand. Interpret and manipulate simplex tableaus.
Formulate a problem as a linear programming problem. Write and interpret dual linear programs. Perform an optimality check on a given solution. Perform sensitivity analysis. 

 

Tag page
Pages that link here
Page statistics
229 view(s), 2 edit(s), and 2117 character(s)

Comments

Viewing 1 of 1 comments: view all
how to do simplex method on texas TI-83(+)/TI-84

http://www2.ohlone.edu/people2/joconnell/ti/simplex8384.pdf
Posted 10:23, 4 Jun 2010
Viewing 1 of 1 comments: view all
You must login to post a comment.

Attach file

Attachments