Main Page > BS Mathematics (Morning) (After 2 Years ADP Mathematics) > MATH-427 Operations Research-II
 |
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
|
MATH-427 Operations Research-II
|
Shortest-Route algorithms for acyclic networks Maximal-flow problem Matrix definition of LP problem Revised simplex method, bounded variables Decomposition algorithm Parametric linear programming Applications of integer programming Cutting-plane algorithms Branch-and-bound method Zero-one implicit enumeration Elements of dynamic programming Problem of dimensionality Programmes by dynamic programming |
| Credit hours/ Marks:- 3 |
|
|
