Interval linear programming

• Thesis title in Czech: Intervalové lineární programování
• Thesis title in English: Interval linear programming
• Key words: Lineární program|Intervalová data|Optimalita|Slabé a silné vlastnosti
• English key words: Linear program|Interval data|Optimality|Weak and strong properties
• Academic year of topic announcement: 2016/2017
• Thesis type: dissertation
• Thesis language: angličtina
• Department: Department of Applied Mathematics (32-KAM)
• Supervisor: prof. Mgr. Milan Hladík, Ph.D.
• Author: hidden - assigned and confirmed by the Study Dept.
• Date of registration: 03.10.2016
• Date of assignment: 03.10.2016
• Confirmed by Study dept. on: 03.10.2016
• Date and time of defence: 29.04.2024 14:30
• Date of electronic submission: 14.11.2023
• Date of submission of printed version: 14.11.2023
• Date of proceeded defence: 29.04.2024
• Opponents: prof. Ralph Baker Kearfott

Guidelines

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.

References

[1] M. Fiedler, J. Nedoma, J. and Ramík, J. Rohn, and K. Zimmermann. Linear Optimization Problems with Inexact Data, Springer, New York 2006.

[2] 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.