| Text | Download (4kB) |
 linear programming, cycling, soft constraints and feasible solutions | using duality theory to solve linear programming problems | revised simplex method | minimum cost network | integer programming and branch and bound algorithm |
MA336exam00
Exam questions and solutions in LaTex
| Added By: |
Mathbank
|
|---|---|
| Date Added: | 22 Apr 2009 12:45 |
| Tags: | Exam Answer, Integer programming, linear programming cycling, 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/2439 |
| Downloads & Views |  |
 |
