635 research outputs found
Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs
This paper deals with uncertain multi-objective convex programming problems, where the data of the objective function or the constraints or both are allowed to be uncertain within specified uncertainty sets. We present sufficient conditions for the existence of highly robust weakly efficient solutions, that is, robust feasible solutions which are weakly efficient for any possible instance of the objective function within a specified uncertainty set. This is done by way of estimating the radius of highly robust weak efficiency under linearly distributed uncertainty of the objective functions. In the particular case of robust quadratic multi-objective programs, we show that these sufficient conditions can be expressed in terms of the original data of the problem, extending and improving the corresponding results in the literature for robust multi-objective linear programs under ball uncertainty.This research was partially supported by the Australian Research Council, Discovery Project DP120100467 and the MINECO of Spain and ERDF of EU, Grants MTM2014-59179-C2-1-P and ECO2016-77200-P
Robust Solutions to Uncertain Multiobjective Programs
Decision making in the presence of uncertainty and multiple conflicting objec-tives is a real-life issue, especially in the fields of engineering, public policy making, business management, and many others. The conflicting goals may originate from the variety of ways to assess a system’s performance such as cost, safety, and affordability, while uncertainty may result from inaccurate or unknown data, limited knowledge, or future changes in the environment. To address optimization problems that incor-porate these two aspects, we focus on the integration of robust and multiobjective optimization. Although the uncertainty may present itself in many different ways due to a diversity of sources, we address the situation of objective-wise uncertainty only in the coefficients of the objective functions, which is drawn from a finite set of scenarios. Among the numerous concepts of robust solutions that have been proposed and de-veloped, we concentrate on a strict concept referred to as highly robust efficiency in which a feasible solution is highly robust efficient provided that it is efficient with respect to every realization of the uncertain data. The main focus of our study is uncertain multiobjective linear programs (UMOLPs), however, nonlinear problems are discussed as well. In the course of our study, we develop properties of the highly robust efficient set, provide its characterization using the cone of improving directions associated with the UMOLP, derive several bound sets on the highly robust efficient set, and present a robust counterpart for a class of UMOLPs. As various results rely on the polar and strict polar of the cone of improving directions, as well as the acuteness of this cone, we derive properties and closed-form representations of the (strict) polar and also propose methods to verify the property of acuteness. Moreover, we undertake the computation of highly robust efficient solutions. We provide methods for checking whether or not the highly robust efficient set is empty, computing highly robust efficient points, and determining whether a given solution of interest is highly robust efficient. An application in the area of bank management is included
The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments
The radius of robust feasibility provides a numerical value for the largest possible uncertainty set that guarantees feasibility of a robust counterpart of a mathematical program with uncertain constraints. The objective of this review of the state-of-the-art in this field is to present this useful tool of robust optimization to its potential users and to avoid undesirable overlapping of research works on the topic as those we have recently detected. In this paper we overview the existing literature on the radius of robust feasibility in continuous and mixed-integer linearly constrained programs, linearly constrained semi-infinite programs, convexly constrained programs, and conic linearly constrained programs. We also analyze the connection between the radius of robust feasibility and the distance to ill-posedness for different types of uncertain mathematical programs.This research was partially supported by the Australian Research Council, Discovery Project grant and the Ministry of Science, Innovation and Universities of Spain and the European Regional Development Fund (ERDF) of the European Commission, Grant PGC2018-097960-B-C22
Qualitative Characteristics and Quantitative Measures of Solution's Reliability in Discrete Optimization: Traditional Analytical Approaches, Innovative Computational Methods and Applicability
The purpose of this thesis is twofold. The first and major part is devoted to
sensitivity analysis of various discrete optimization problems while the second
part addresses methods applied for calculating measures of solution stability
and solving multicriteria discrete optimization problems.
Despite numerous approaches to stability analysis of discrete optimization
problems two major directions can be single out: quantitative and qualitative.
Qualitative sensitivity analysis is conducted for multicriteria discrete optimization
problems with minisum, minimax and minimin partial criteria. The main
results obtained here are necessary and sufficient conditions for different stability
types of optimal solutions (or a set of optimal solutions) of the considered
problems.
Within the framework of quantitative direction various measures of solution
stability are investigated. A formula for a quantitative characteristic called
stability radius is obtained for the generalized equilibrium situation invariant
to changes of game parameters in the case of the H¨older metric. Quality of the
problem solution can also be described in terms of robustness analysis. In this
work the concepts of accuracy and robustness tolerances are presented for a
strategic game with a finite number of players where initial coefficients (costs)
of linear payoff functions are subject to perturbations.
Investigation of stability radius also aims to devise methods for its calculation.
A new metaheuristic approach is derived for calculation of stability
radius of an optimal solution to the shortest path problem. The main advantage
of the developed method is that it can be potentially applicable for
calculating stability radii of NP-hard problems.
The last chapter of the thesis focuses on deriving innovative methods based
on interactive optimization approach for solving multicriteria combinatorial
optimization problems. The key idea of the proposed approach is to utilize
a parameterized achievement scalarizing function for solution calculation and
to direct interactive procedure by changing weighting coefficients of this function.
In order to illustrate the introduced ideas a decision making process is
simulated for three objective median location problem.
The concepts, models, and ideas collected and analyzed in this thesis create
a good and relevant grounds for developing more complicated and integrated
models of postoptimal analysis and solving the most computationally challenging
problems related to it.Siirretty Doriast
International Conference on Continuous Optimization (ICCOPT) 2019 Conference Book
The Sixth International Conference on Continuous Optimization took place on the campus of the Technical University of Berlin, August 3-8, 2019. The ICCOPT is a flagship conference of the Mathematical Optimization Society (MOS), organized every three years. ICCOPT 2019 was hosted by the Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Berlin. It included a Summer School and a Conference with a series of plenary and semi-plenary talks, organized and contributed sessions, and poster sessions.
This book comprises the full conference program. It contains, in particular, the scientific program in survey style as well as with all details, and information on the social program, the venue, special meetings, and more
Recommended from our members
Numerical Methods for PDE Constrained Optimization with Uncertain Data
Optimization problems governed by partial differential equations (PDEs) arise in many applications in the form of optimal control, optimal design, or parameter identification problems. In most applications, parameters in the governing PDEs are not deterministic, but rather have to be modeled as random variables or, more generally, as random fields. It is crucial to capture and quantify the uncertainty in such problems rather than to simply replace the uncertain coefficients with their mean values. However, treating the uncertainty adequately and in a computationally tractable manner poses many mathematical challenges. The numerical solution of optimization problems governed by stochastic PDEs builds on mathematical subareas, which so far have been largely investigated in separate communities: Stochastic Programming, Numerical Solution of Stochastic PDEs, and PDE Constrained Optimization.
The workshop achieved an impulse towards cross-fertilization of those disciplines which also was the subject of several scientific discussions. It is to be expected that future exchange of ideas between these areas will give rise to new insights and powerful new numerical methods
- …