Most algorithms in modern everyday life are well-understood; the theoretical predictions we can make about them closely match what we can observe in practice. However, this is not the case for all algorithms, some are still poorly understood even after nearly 80 years of heavy use. This is the case many algorithms for solving optimization problems from 'operations research'. Solving such problems is essential in many industries and done many times every day.
The most basic of these optimization problems are known as 'linear programming problems'. Multiple different algorithms exist to solve these problems in practice, but all these are poorly understood from a theoretical perspective.
This research makes progress towards understanding the most basic algorithms for solving linear programming problems, including the Simplex Method, Interior Point Methods, and Cutting Plane Methods.
The research was carried out at Centrum Wiskunde & Informatica (CWI).
- Start date and time
- End date and time
- Academiegebouw, Domplein 29 & online
- PhD candidate
- S. Huiberts
- Geometric Aspects of Linear Programming; Shadow paths, central paths, and a cutting plane method
- PhD supervisor(s)
- prof. dr. G.L.M. Cornelissen
- dr. D.N. Dadush
- More information
- Full text via Utrecht University Repository