Search Course Outline

Linear programming, the revised simplex method and its computational aspects, duality and the dual simplex method, sensitivity and post-optimal analysis. Network optimisation models and maximum flow algorithms. Transportation, assignment and transhipment models, and the network simplex method. Integer programming. The implementation and solution of optimisation models for practical applications.

Linear programming, the revised simplex method and its computational aspects, duality and the dual simplex method, sensitivity and post-optimal analysis. Network optimisation models and maximum flow algorithms. Transportation, assignment and transhipment models, and the network simplex method. Integer programming. The implementation and solution of optimisation models for practical applications.

Linear programming, the revised simplex method and its computational aspects, duality and the dual simplex method, sensitivity and post-optimal analysis. Network optimisation models and maximum flow algorithms. Transportation, assignment and transhipment models, and the network simplex method. Integer programming. The implementation and solution of optimisation models for practical applications.

Linear programming, the revised simplex method and its computational aspects, duality and the dual simplex method, sensitivity and post-optimal analysis. Network optimisation models and maximum flow algorithms. Transportation, assignment and transhipment models, and the network simplex method. Integer programming. The implementation and solution of optimisation models for practical applications.

Linear programming, the revised simplex method and its computational aspects, duality and the dual simplex method, sensitivity and post-optimal analysis. Network optimisation models and maximum flow algorithms. Transportation, assignment and transhipment models, and the network simplex method. Integer programming. The implementation and solution of optimisation models for practical applications.