Loading previews...| Text | Download (4kB) |
 linear programming, feasible solutions and the simplex and dual simplex methods | using duality theory for solving linear programming problems | linear programming and the simplex method | minimum cost network | integer programming and the branch and bound algorithm |
MA336exam01
Exam questions and solutions in LaTex
| Added By: |
Mathbank
|
|---|---|
| Date Added: | 22 Apr 2009 12:33 |
| Tags: | Exam Answer, Integer programming, duality theory, Branch and Bound, Linear Programming, simplex, integer programming branch bound algorithm, Exam Question, minimum cost network, Optimisation, mathbank |
| Viewing permissions: | World |
| Link: | http://edshare.soton.ac.uk/id/eprint/2378 |
| Downloads & Views |  |
 |