Research projects

Charles University Grant Agency (GAUK) project No. 156317 on Interval linear programming (2017–2019), principal researcher

Czech Science Foundation (GAČR) project No. P403-18-04735S on Novel approaches for relaxation and approximation techniques in deterministic global optimization (2018–2020), team member


Elif Garajová and Milan Hladík, Checking weak optimality and strong boundedness in interval linear programming.
Soft Computing, 2018 [online]. (link)

Elif Garajová, Milan Hladík and Miroslav Rada, Interval linear programming under transformations: optimal solutions and optimal value range.
Central European Journal of Operations Research, 2018 [online]. (link)

Miroslav Rada, Milan Hladík and Elif Garajová, Testing weak optimality of a given solution in interval linear programming revisited:
NP-hardness proof, algorithm and some polynomially-solvable cases
Optimization Letters, 2018 [online]. (link)

Milan Hladík, Miroslav Rada, Sebastian Sitarz and Elif Garajová, Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem.
Optimization, 2019. (link)

Elif Garajová and Milan Hladík, On the optimal solution set in interval linear programming.
Computational Optimization and Applications, 2019. (link)

Elif Garajová, Milan Hladík and Miroslav Rada, On the Properties of Interval Linear Programs with a Fixed Coefficient Matrix.
Optimization and Decision Science: Methodologies and Applications, ODS 2017, Springer PROMS, 2017. (link)

Elif Garajová, Milan Hladík and Miroslav Rada, The Effects of Transformations on the Optimal Set in Interval Linear Programming.
Proceedings of the 14th International Symposium on Operational Research, SOR’17, pp. 487–492, 2017. (link)

Elif Garajová and Martin Mečiar, Solving and Visualizing Nonlinear Set Inversion Problems.
Reliable Computing, 2016. (pdf) (link)

Conference talks

KOI 2018: The 17th International Conference on Operational Research (Zadar, Croatia), September 2018
The best and the worst: Computing the optimal value range in interval linear programming (slides)

SCAN 2018: The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations (Tokyo, Japan), September 2018
Seeking Optimality in Interval Linear Programming (slides)

EURO 2018: 29th European Conference On Operational Research (Valencia, Spain), July 2018
Optimality and boundedness in interval linear programming: complexity and characterization (slides)

SOR '17: The 14th International Symposium on Operations Research in Slovenia (Bled, Slovenia), September 2017
The Effects of Transformations on the Optimal Set in Interval Linear Programming (slides)

Paraopt XI: 11th International Conference on Parametric Optimization and Related Topics (Prague, Czech Republic), September 2017
Approximating the Optimal Value Range in Interval Linear Programming (slides)

ODS 2017: International Conference on Optimization and Decision Science (Sorrento, Italy), September 2017
On the Properties of Interval Linear Programs with a Fixed Coefficient Matrix (slides)

SWIM 2015: 8th Small Workshop on Interval Methods (Prague, Czech Republic), June 2015
Solving and Visualizing Nonlinear Constraint Satisfaction Problems (slides) (abstract)


Master thesis (September 2016)
The optimal solution set of interval linear programming problems (link)

Bachelor thesis (June 2014)
Interval solver for nonlinear constraints (in Slovak) (link)