Solution Techniques for Classes of Biobjective and Parametric Programs

Mathematical optimization, or mathematical programming, has been studied for several decades. Researchers are constantly searching for optimization techniques which allow one to determine the ideal course of action in extremely complex situations. This line of scientific inquiry motivates the primary focus of this dissertation — nontraditional optimization problems having either multiple objective functions or parametric input. Utilizing multiple objective functions allows one to account for the fact that the decision process in many real-life problems in engineering, business, and management is often driven by several conflicting criteria such as cost, performance, reliability, safety, and productivity. Additionally, incorporating parametric input allows one to account for uncertainty in models’ data, which can arise for a number of reasons, including a changing availability of resources, estimation or measurement errors, or implementation errors caused by storing data in a fixed precision format. However, when a decision problem has either parametric input or multiple objectives, one cannot hope to find a single, satisfactory solution. Thus, in this work we develop techniques which can be used to determine sets of desirable solutions. The two main problems we consider in this work are the biobjective mixed integer linear program (BOMILP) and the multiparametric linear complementarity problem (mpLCP). BOMILPs are optimization problems in which two linear objectives are optimized over a polyhedron while restricting some of the decision variables to be integer. We present a new data structure in the form of a modified binary tree that can be used to store the solution set of BOMILP. Empirical evidence is provided showing that this structure is able to store these solution sets more efficiently than other data structures that are typically used for this purpose. We also develop a branch-and-bound (BB) procedure that can be used to compute the solution set of BOMILP. Computational experiments are conducted in order to compare the performance of the new BB

[1]  Anthony Przybylski,et al.  Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case , 2013, Comput. Oper. Res..

[2]  Tor Arne Johansen,et al.  Continuous Selection and Unique Polyhedral Representation of Solutions to Convex Parametric Quadratic Programs , 2007 .

[3]  Oleksandr Romanko,et al.  Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors , 2007, Algorithmic Oper. Res..

[4]  Matthias Ehrgott,et al.  A Level Set Method for Multiobjective Combinatorial Optimization: Application to the Quadratic Assignment Problem , 2002 .

[5]  Marcel Courtillot New Methods in Mathematical Programming---On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem , 1962 .

[6]  Pietro Belotti,et al.  Efficient storage of Pareto points in biobjective mixed integer programming , 2014, INFORMS J. Comput..

[7]  Francis Sourd,et al.  A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem , 2008, INFORMS J. Comput..

[8]  R. A. Danao On the Parametric Linear Complementarity Problem , 1997 .

[9]  Minghe Sun,et al.  A primogenitary linked quad tree data structure and its application to discrete multiple criteria optimization , 2006, Ann. Oper. Res..

[10]  Minghe Sun,et al.  Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors , 1996, INFORMS J. Comput..

[11]  Alexander Martin,et al.  General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms , 2000, Computational Combinatorial Optimization.

[12]  Jesús A. De Loera,et al.  Pareto Optima of Multicriteria Integer Linear Programs , 2009, INFORMS J. Comput..

[13]  Yi Cao,et al.  Multiobjective Control Structure Design: A Branch and Bound Approach , 2012 .

[14]  Zhengxin Chen,et al.  A Multi-criteria Convex Quadratic Programming model for credit data analysis , 2008, Decis. Support Syst..

[15]  Jong-Shi Pang,et al.  A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset , 1980, Oper. Res..

[17]  大澤 義明 A geometrical solution for quadratic bicriteria location models , 1997 .

[18]  Jan van Leeuwen,et al.  Dynamic multi-dimensional data structures based on quad- and k—d trees , 1982, Acta Informatica.

[19]  Gilbert Laporte,et al.  A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem , 2012, INFORMS J. Comput..

[20]  Marianthi G. Ierapetritou,et al.  A method for solving the general parametric linear complementarity problem , 2010, Ann. Oper. Res..

[21]  C. J. Goh,et al.  Analytic efficient solution set for bi-criteria quadratic network programs , 1997 .

[22]  E. Altman,et al.  An asymptotic simplex method for parametric linear programming , 1999, 1999 Information, Decision and Control. Data and Information Fusion Symposium, Signal Processing and Communications Symposium and Decision and Control Symposium. Proceedings (Cat. No.99EX251).

[23]  Yue Qi,et al.  Comparative issues in large-scale mean-variance efficient frontier computation , 2011, Decis. Support Syst..

[24]  Manfred Morari,et al.  Enumeration-based approach to solving parametric linear complementarity problems , 2015, Autom..

[25]  Hannu Väliaho,et al.  A unified approach to one-parametric general quadratic programming , 1985, Math. Program..

[26]  P. Jonker,et al.  One-Parametric Linear-Quadratic Optimization Problems , 2001, Ann. Oper. Res..

[27]  G. Maier A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes , 1970 .

[28]  Manfred Morari,et al.  Multiparametric Linear Complementarity Problems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[29]  Yue Qi,et al.  Computing the Nondominated Surface in Tri-Criterion Portfolio Selection , 2013, Oper. Res..

[30]  Thorsten Koch,et al.  Progress in presolving for mixed integer programming , 2015, Math. Program. Comput..

[31]  S. R. Arora,et al.  Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming , 2011 .

[32]  Anthony Przybylski,et al.  A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives , 2010, Discret. Optim..

[33]  Sasho Kalajdzievski,et al.  An Illustrated Introduction to Topology and Homotopy , 2015 .

[34]  Efstratios N. Pistikopoulos,et al.  Theoretical and algorithmic advances in multi-parametric programming and control , 2012, Comput. Manag. Sci..

[35]  Jing-Rung Yu,et al.  Portfolio rebalancing model using multiple criteria , 2011, Eur. J. Oper. Res..

[36]  Panagiotis Patrinos,et al.  A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings , 2010, Autom..

[37]  Thomas R. Stidsen,et al.  A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs , 2014, Manag. Sci..

[38]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[39]  Pietro Belotti,et al.  Fathoming rules for biobjective mixed integer linear programs: Review and extensions , 2016 .

[40]  Oleksandr Romanko,et al.  Bi-parametric convex quadratic optimization , 2010, Optim. Methods Softw..

[41]  Margaret M. Wiecek,et al.  An improved algorithm for solving biobjective integer programs , 2006, Ann. Oper. Res..

[42]  Tor Arne Johansen,et al.  Explicit nonlinear model predictive control : theory and applications , 2012 .

[43]  Matthias Ehrgott,et al.  Multicriteria Optimization (2. ed.) , 2005 .

[44]  Martin W. P. Savelsbergh,et al.  A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method , 2015, INFORMS J. Comput..

[45]  Constantin Zopounidis,et al.  Multiple criteria decision aiding for finance: An updated bibliographic survey , 2015, Eur. J. Oper. Res..

[46]  H. Väliaho,et al.  Determining the handicap of a sufficient matrix , 1997 .

[47]  G. Kiziltan,et al.  An Algorithm for Multiobjective Zero-One Linear Programming , 1983 .

[48]  Martin W. P. Savelsbergh,et al.  The Triangle Splitting Method for Biobjective Mixed Integer Programming , 2014, IPCO.

[49]  R. Jagannathan,et al.  Parametric linear programming: Some special cases , 1973 .

[50]  C. E. Lemke,et al.  Bimatrix Equilibrium Points and Mathematical Programming , 1965 .

[51]  Richard W. Cottle Monotone solutions of the parametric linear complementarity problem , 1972, Math. Program..

[52]  Kamal Smimou,et al.  International portfolio choice and political instability risk: A multi-objective approach , 2014, Eur. J. Oper. Res..

[53]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[54]  Alexander Barvinok,et al.  A course in convexity , 2002, Graduate studies in mathematics.

[55]  Margaret M. Wiecek,et al.  A two-phase algorithm for the multiparametric linear complementarity problem , 2016, Eur. J. Oper. Res..

[56]  H. Väliaho,et al.  Criteria for sufficient matrices , 1996 .

[57]  Banu Soylu,et al.  Heuristic approaches for biobjective mixed 0-1 integer linear programming problems , 2015, Eur. J. Oper. Res..

[58]  Alberto Bemporad,et al.  An algorithm for multi-parametric quadratic programming and explicit MPC solutions , 2003, Autom..

[59]  Jong-Shi Pang,et al.  On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation , 1979, Math. Program..

[60]  K. G. Murty,et al.  LINEAR COMPLEMENTARITY � LINEAR AND NONLINEAR PROGRAMMING Internet Edition , 2006 .

[61]  Yves Smeers,et al.  A new resolution method for the parametric linear complementarity problem , 2001, Eur. J. Oper. Res..

[62]  Klaus Tammer Parametric Linear Complementarity Problems , 1996 .

[63]  M. Morari,et al.  On-line optimization via off-line parametric optimization tools , 2000 .

[64]  R. Cottle,et al.  Sufficient matrices and the linear complementarity problem , 1989 .

[65]  Matthias Ehrgott,et al.  Bound sets for biobjective combinatorial optimization problems , 2007, Comput. Oper. Res..

[66]  Xiaoqi Yang,et al.  Analytic efficient solution set for multi-criteria quadratic programs , 1996 .

[67]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[68]  G. M. Introduction to Higher Algebra , 1908, Nature.

[69]  George Mavrotas,et al.  Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming , 2005, Appl. Math. Comput..

[70]  Klaus Ritter Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme , 1962, Unternehmensforschung.

[71]  Alberto Bemporad,et al.  The explicit solution of model predictive control via multiparametric quadratic programming , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[72]  M. M. Kostreva,et al.  Generalization of Murty's direct algorithm to linear and convex quadratic programming , 1989 .

[73]  Baichun Xiao The linear complementarity problem with a parametric input , 1995 .

[74]  Komei Fukuda,et al.  An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices , 2008, 0807.2318.

[75]  H. Väliaho A procedure for the one-parametric linear complementarity problem , 1994 .

[76]  Arun Gupta,et al.  A novel approach to multiparametric quadratic programming , 2011, Autom..

[77]  T. Johansen,et al.  Further results on multiparametric quadratic programming , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[78]  Leopold B. Willner On Parametric Linear Programming , 1967 .

[79]  Yue Qi,et al.  Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming , 2010, Eur. J. Oper. Res..

[80]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[81]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[82]  H. Väliaho A procedure for one-parametric linear programming , 1979 .

[83]  Manfred Morari,et al.  Multi-Parametric Toolbox 3.0 , 2013, 2013 European Control Conference (ECC).

[84]  Murat Köksalan,et al.  An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs , 2010, Manag. Sci..

[85]  Colin Neil Jones,et al.  On the facet-to-facet property of solutions to convex parametric quadratic programs , 2006, Autom..

[86]  Oleksandr Romanko Parametric and Multiobjective Optimization with Applications in Finance , 2010 .

[87]  Richard W. Cottle,et al.  A field guide to the matrix classes found in the literature of the linear complementarity problem , 2010, J. Glob. Optim..

[88]  Chaiho Kim,et al.  Parameterizing an Activity Vector in Linear Programming , 1971, Oper. Res..

[89]  Antonin Ponsich,et al.  A Survey on Multiobjective Evolutionary Algorithms for the Solution of the Portfolio Optimization Problem and Other Finance and Economics Applications , 2013, IEEE Transactions on Evolutionary Computation.

[90]  S. Barnett,et al.  A Simple Class of Parametric Linear Programming Problems , 1968, Oper. Res..

[91]  Iftekhar A. Karimi,et al.  Parametric optimization with uncertainty on the left hand side of linear programs , 2014, Comput. Chem. Eng..