hidden - assigned and confirmed by the Study Dept.
Date of registration:
Date of assignment:
Confirmed by Study dept. on:
In interval linear programming, there are still many open challenging problems, both in theory and algorithms: Characterization of the optimal solution set and topological properties of this set. Developing algorithms for tight (inner or outer) enclosures of the optimal solutions. Checking weak optimality. Focusing on tractable subclasses. Application in global optimization.
 M. Fiedler, J. Nedoma, J. and Ramík, J. Rohn, and K. Zimmermann. Linear Optimization Problems with Inexact Data, Springer, New York 2006.
 M. Hladík. Interval linear programming: A survey. In Z.Á. Mann, ed., Linear Programming - New Frontiers in Theory and Applications, pp. 85-120, Nova Science Publishers, New York, 2012.