 | XIMB Fellow Programme in Management (Doctoral Level) |
| FPM Scholars [none] | Optimisation Research Guide: Sambit Mukherjee About Optimisation Research Optimization theory and applications constitute a major area of investigation in the broader field of Operations Research (OR). Typically research in this area focuses on developing mathematical models of real world problems from diverse areas like manufacturing, transportation, communication, health care, etc. The models are then solved with specially developed software which have a library of solution algorithms. Another direction of research in optimisation methods is the development of efficient solution algorithms for solving diverse problems on a computer. This area overlaps with research in computer science. Typical problems investigated in optimisation research: (a) shortest path: label setting algorithms and label correcting algorithms, (b) maximum flows: polynomial algorithms, (c) minimum cost flows: basic algorithms, polynomial algorithms, and metwork simplex algorithms, (d) dual fractional integer programming, dual fractional mixed integer programming, and dual all integer programming (e) primal all integer programming, (f) branch and bound enumeration, (g) search enumeration, and (h) partitioning in mixed integer programming. Resources Books Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Prentice Hall. Wolsey, L. A. (1998). Integer programming. Wiley-Interscience. Schrijver, A. (1998). Theory of linear and integer programming. Wiley. Web Sites Optimization Software http://www-fp.mcs.anl.gov/otc/Guide/SoftwareGuide/ Expected Profile Students in this area are expected to have strong quantitative and analytical background. They should express an interest in mathematical modeling techniques and algorithms. Good computational abilities will be an advantage. |
FPM Cell Xavier Institute of Management Xavier Square, Bhubaneswar 751013, INDIA email: dean@ximb.ac.in |