Angelos Georghiou

Angelos Georghiou

Auto-generated profile, based on publicly available information

Angelos Georghiou

Department of Business and Public Administration, University of Cyprus, Nicosia 1678, Cyprus

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 December 2009 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
DKDaniel Kuhn
Daniel Kuhn
WWWolfram Wiesemann
Wolfram Wiesemann
AGAngelos Georghiou
Angelos Georghiou

25 May 2014 in Mathematical Programming
Verified
Journal Article
Open access
PDF file
AGAngelos Georghiou
Angelos Georghiou
WWWolfram Wiesemann
Wolfram Wiesemann
DKDaniel Kuhn
Daniel Kuhn
Stochastic programming provides a versatile framework for decision-making under uncertainty, but the resulting optimization problems can be computationally demanding. It has recently been shown that primal and dual linear decision rule approximations can yield tractable upper and lower bounds on the optimal value of a stochastic program. Unfortunately, linear decision rules often provide crude approximations that result in loose bounds. To address this problem, we propose a lifting technique that maps a given stochastic program to an equivalent problem on a higher-dimensional probability space. We prove that solving the lifted problem in primal and dual linear decision rules provides tighter bounds than those obtained from applying linear decision rules to the original problem. We also show that there is a one-to-one correspondence between linear decision rules in the lifted problem and families of nonlinear decision rules in the original problem. Finally, we identify structured liftings that give rise to highly flexible piecewise linear and nonlinear decision rules, and we assess their performance in the context of a dynamic production planning problem.

1 June 2015 in Operations Research
Verified
Journal Article
Open access
DBDimitris Bertsimas
Dimitris Bertsimas
AGAngelos Georghiou
Angelos Georghiou
In recent years, decision rules have been established as the preferred solution method for addressing computationally demanding, multistage adaptive optimization problems. Despite their success, existing decision rules (a) are typically constrained by their a priori design and (b) do not incorporate in their modeling adaptive binary decisions. To address these problems, we first derive the structure for optimal decision rules involving continuous and binary variables as piecewise linear and piecewise constant functions, respectively. We then propose a methodology for the optimal design of such decision rules that have a finite number of pieces and solve the problem robustly using mixed-integer optimization. We demonstrate the effectiveness of the proposed methods in the context of two multistage inventory control problems. We provide global lower bounds and show that our approach is (i) practically tractable and (ii) provides high quality solutions that outperform alternative methods.

1 January 2017 in Automatica
Verified
Journal Article
Closed access
XZXiaojing Zhang
Xiaojing Zhang
MKMaryam Kamgarpour
Maryam Kamgarpour
AGAngelos Georghiou
Angelos Georghiou
PGPaul Goulart
Paul Goulart
JLJohn Lygeros
John Lygeros

1 May 2019 in Operations Research
Verified
Journal Article
Closed access
AGAngelos Georghiou
Angelos Georghiou
ATAngelos Tsoukalas
Angelos Tsoukalas
WWWolfram Wiesemann
Wolfram Wiesemann
In the paper “Robust Dual Dynamic Programming,” Angelos Georghiou, Angelos Tsoukalas, and Wolfram Wiesemann propose a novel solution scheme for addressing planning problems with long horizons. Such problems can be formulated as multistage robust optimization problems. The proposed method takes advantage of the decomposable nature of these problems by bounding the costs arising in the future stages through lower and upper cost-to-go functions. The proposed scheme does not require a relatively complete recourse, and it offers deterministic upper and lower bounds throughout the execution of the algorithm. The promising performance of the algorithm is shown in a stylized inventory-management problem in which the proposed algorithm achieved the optimal solution in problem instances with 100 time stages in a few minutes.

24 March 2017 in Mathematical Programming
Verified
Journal Article
Open access
PDF file
DBDimitris Bertsimas
Dimitris Bertsimas
AGAngelos Georghiou
Angelos Georghiou
Decision rules provide a flexible toolbox for solving computationally demanding, multistage adaptive optimization problems. There is a plethora of real-valued decision rules that are highly scalable and achieve good quality solutions. On the other hand, existing binary decision rule structures tend to produce good quality solutions at the expense of limited scalability and are typically confined to worst-case optimization problems. To address these issues, we first propose a linearly parameterised binary decision rule structure and derive the exact reformulation of the decision rule problem. In the cases where the resulting optimization problem grows exponentially with respect to the problem data, we provide a systematic methodology that trades-off scalability and optimality, resulting to practical binary decision rules. We also apply the proposed binary decision rules to the class of problems with random-recourse and show that they share similar complexity as the fixed-recourse problems. Our numerical results demonstrate the effectiveness of the proposed binary decision rules and show that they are (i) highly scalable and (ii) provide high quality solutions.