The algorithm is parameterized so as to address various stochastic formulations spanning from Expectation-focused to Value-at-Risk (VaR) as well as Conditional-Value-at-Risk (CVaR) as well as Conditional-Value-at-Risk (CVaR)-focused formulations.
Convexity and generalized convexity play a central role in mathematical programming for duality results and in order to characterize the solutions set. In this paper, taking in mind Craven's notion of K-invexity function (when K is a cone in
\mathbb{R}^n
R
n
) and Martin's notion of Karush-Kuh...
B. Hernández-Jiménez, R. Osuna-Gómez, M. Rojas-Medar· Journal of Convex Analysis· 0 citations
A state-of-the-art survey of major algorithms suggested to solve Multiple Objective Linear Programming (MOLP) and a tabulated summary of all algorithms are included.
P. Nyiam, A. Salhi· Mathematics and Computer Sci...· 0 citations
The contribution is a proof that there exist measurable versions of intermediate value functions, which reveals regularity in addition, and a verification theorems allow stating traditional problem specifications in the novel setting with mathematical rigor.
Paul Dommel, A. Pichler· Journal of Convex Analysis· 2 citations
A unified framework, based on decision diagrams, is proposed that serves both to solve the associated optimization problems and to construct ideal conic quadratic extended formulations of the closure of the convex hull of the underlying mixed-integer set.
Soobin Choi, S. Fattahi, Andrés Gómez et al.· 1 citation
The concept of counterfactual explanations (CEs) has recently gained increasing attention for deriving explanations of mathematical optimization problems. For a given problem, a counterfactual is an ideally minimal change in the mutable problem parameters such that an optimal solution of the changed problem exists fulf...
Marc Goerigk, Jannis Kurtz, Sebastian Merten· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.