Robust optimization revisited via robust vector Farkas lemmas
نویسندگان
چکیده
منابع مشابه
Stochastic Analysis via Robust Optimization
To evaluate the performance and optimize systems under uncertainty, two main avenues have been suggested in the literature: stochastic analysis and optimization describing the uncertainty probabilistically and robust optimization describing the uncertainty deterministically. Instead, we propose a novel paradigm which leverages the conclusions of probability theory and the tractability of the ro...
متن کاملRobust Orbit Determination via Convex Optimization
Given the initial position and velocity of an object, such as a satellite in orbit around the Earth, it is possible to determine its position and velocity at any other time by integrating the equations of motion. This prediction method is called propagating. Specifying the position and velocity of the satellite at a specific time, called the epoch, is a common way of representing an orbit. In t...
متن کاملThe Farkas Lemma Revisited
The Farkas Lemma is extended to simultaneous linear operator and polyhedral sublinear operator inequalities by Boolean valued analysis. Introduction The Farkas Lemma, also known as the Farkas–Minkowski Lemma, plays a key role in linear programming and the relevant areas of optimization (cp. [1]). Some rather simple proof of the lemma is given in [2]. Using the technique of Boolean valued analys...
متن کاملSingle-Product Pricing via Robust Optimization
We present a robust optimization approach to the problem of pricing a capacitated product over a finite time horizon in the presence of demand uncertainty. This technique does not require the knowledge of the underlying probability distributions, which in practice are difficult to estimate accurately, and instead models random variables as uncertain parameters belonging to a polyhedral uncertai...
متن کاملAdjustable Robust Optimization via Fourier-Motzkin Elimination
We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broad class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique that can ef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization
سال: 2016
ISSN: 0233-1934,1029-4945
DOI: 10.1080/02331934.2016.1152272