This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: transshipment model. 10 Be able to develop network and linear programming models of the transshipment problem. 11. Know the basic characteristics of the shortest route problem. 12. Be able to develop a linear programming model and solve the shortest route problem. 13. Know the basic characteristics of the maximal flow problem. 14. Be able to develop a linear programming model and solve the maximal flow problem. 15. Know how to structure and solve a production and inventory problem as a transshipment problem. 16. Understand the following terms: network flow problem capacitated transshipment problem transportation problem shortest route origin maximal flow destination source node capacitated transportation problem sink node assignment problem arc flow capacities transshipment problem...
View
Full Document
 Spring '10
 J.LOUTEN
 Operations Research, Shortest path problem, Flow network, Maximum flow problem, Maxflow mincut theorem

Click to edit the document details