| Text | Download (3kB) |
 linear programming and the dual simplex method | using duality theory to solve linear programming problems | linear programming and the simplex method | minimum cost network | branch and bound algorithm |
MA336exam99
Exam questions and solutions in LaTex
| Added By: |
Mathbank
|
|---|---|
| Date Added: | 22 Apr 2009 12:26 |
| Tags: | Exam Answer, duality theory, Branch and Bound, Linear Programming, simplex, Exam Question, minimum cost network, Optimisation, mathbank, dual simplex, branch bound algorithm |
| Viewing permissions: | World |
| Link: | http://edshare.soton.ac.uk/id/eprint/2330 |
| Downloads & Views |  |
 |
