Lists
Lists
Loading previews...| LaTeX | Download (0B) |
 linear programming, feasible solutions and the simplex and dual simplex methods (LaTeX) | using duality theory for solving linear programming problems (LaTeX) | linear programming and the simplex method (LaTeX) | minimum cost network (LaTeX) | integer programming and the branch and bound algorithm (LaTeX) |
MA336exam01
Exam questions and solutions in LaTex
| Added By: | Justin Bradley |
|---|---|
| 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 |
| URL: | http://hub.edshare.ac.uk/id/eprint/2551 |
| Downloads & Views |  |
Actions (login required)
 |
View Item |