26 research outputs found
Primal and dual conic representable sets: a fresh view on multiparametric analysis
This paper introduces the concepts of the primal and dual conic (linear
inequality) representable sets and applies them to explore a novel kind of
duality in multiparametric conic linear optimization. Such a kind of duality
may be described by the set-valued mappings between the primal and dual conic
representable sets, which allows us to generalize as well as treat previous
results for mulitparametric analysis in a unified framework. In particular, it
leads to the invariant region decomposition of a conic representable set that
is more general than the known results in the literatures.
We develop the classical duality theory in conic linear optimization and
obtain the multiparametric KKT conditions. As their applications, we then
discuss the behaviour of the optimal partition of a conic representable set and
investigate the multiparametric analysis of conic linear optimization problems.
All results are corroborated by examples having correlation.Comment: 38 pages, 3 figur
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 de-termine 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 al-lows 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 ac-count 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 stor-ing 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 procedure with current state-of-the-art methods for determining the solution set of BOMILP. The results provide strong evidence of the utility of the proposed BB method. We also present new procedures for solving two variants of the mpLCP. Each of these proce-dures consists of two phases. In the first phase an initial feasible solution to mpLCP which satisfies certain criteria is determined. This contribution alone is significant because the question of how such an initial solution could be generated was previously unanswered. In the second phase the set of fea-sible parameters is partitioned into regions such that the solution of the mpLCP, as a function of the parameters, is invariant over each region. For the first variant of mpLCP, the worst-case complex-ity of the presented procedure matches that of current state-of-the-art methods for nondegenerate problems and is lower than that of current state-of-the-art methods for degenerate problems. Addi-tionally, computational results show that the proposed procedure significantly outperforms current state-of-the-art methods in practice. The second variant of mpLCP we consider was previously un-solved. In order to develop a solution strategy, we first study the structure of the problem in detail. This study relies on the integration of several key concepts from algebraic geometry and topology into the field of operations research. Using these tools we build the theoretical foundation necessary to solve the mpLCP and propose a strategy for doing so. Experimental results indicate that the presented solution method also performs well in practice
The existence of a strongly polynomial time simplex method
It is well known how to clarify whether there is a polynomial time simplex
algorithm for linear programming (LP) is the most challenging open problem in
optimization and discrete geometry. This paper gives a affirmative answer to
this open question by the use of the parametric analysis technique that we
recently proposed. We show that there is a simplex algorithm whose number of
pivoting steps does not exceed the number of variables of a LP problem.Comment: 17 pages, 1 figur
Parametric LP Analysis
Parametric linear programming is the study of how optimal properties depend on data parametrizations. The study is nearly as old as the field of linear programming itself, and it is important since it highlights how a problem changes as what is often estimated data varies. We present what is a modern perspective on the classical analysis of the objective value\u27s response to parametrizations in the right-hand side and cost vector. We also mention a few applications and provide citations for further stud
Linear programming sensitivity measured by the optimal value worst-case analysis
This paper introduces a concept of a derivative of the optimal value function
in linear programming (LP). Basically, it is the the worst case optimal value
of an interval LP problem when the nominal data the data are inflated to
intervals according to given perturbation patterns. By definition, the
derivative expresses how the optimal value can worsen when the data are subject
to variation. In addition, it also gives a certain sensitivity measure or
condition number of an LP problem.
If the LP problem is nondegenerate, the derivatives are easy to calculate
from the computed primal and dual optimal solutions. For degenerate problems,
the computation is more difficult. We propose an upper bound and some kind of
characterization, but there are many open problems remaining.
We carried out numerical experiments with specific LP problems and with real
LP data from Netlib repository. They show that the derivatives give a suitable
sensitivity measure of LP problems. It remains an open problem how to
efficiently and rigorously handle degenerate problems
Multi-parametric linear programming under global uncertainty
Multi-parametric programming has proven to be an invaluable tool for optimisation under uncertainty. Despite the theoretical developments in this area, the ability to handle uncertain parameters on the left-hand side remains limited and as a result, hybrid, or approximate solution strategies have been proposed in the literature. In this work, a new algorithm is introduced for the exact solution of multi-parametric linear programming problems with simultaneous variations in the objective function's coefficients, the right-hand side and the left-hand side of the constraints. The proposed methodology is based on the analytical solution of the system of equations derived from the first order Karush–Kuhn–Tucker conditions for general linear programming problems using symbolic manipulation. Emphasis is given on the ability of the proposed methodology to handle efficiently the LHS uncertainty by computing exactly the corresponding nonconvex critical regions while numerical studies underline further the advantages of the proposed methodology, when compared to existing algorithms