Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/comparison-of-two-algorithms-for-solving-a-two-stage-bilinear-AIXk3zxHtM
References (29)
-
VF Dem'yanov, LV Vasil'ev (1981)
Nondifferential Optimization [in Russian] -
R. Wets (1974)
Stochastic Programs with Fixed Recourse: The Equivalent Deterministic ProgramSiam Review, 16
-
András Prékopa (1995)
Stochastic ProgrammingOptimizations and Programming
-
N Larsen, H Mausser, S Uryasev (2002)
Financial Engineering, e‐Commerce and Supply Chain -
S. Ivanov, A. Naumov (2012)
Algorithm to optimize the quantile criterion for the polyhedral loss function and discrete distribution of random parametersAutomation and Remote Control, 73
-
DB Yudin (1979)
Stochastic Programming: Problems and Methods [in Russian] -
A. Schrijver (1986)
Theory of linear and integer programming -
AI Kibzun, VV Malyshev (1985)
Generalized minimax approach to solving optimization problems with chance constrained, 1
-
D Wozabal, R Hochreiter, GC Pflug (2010)
A D.C. formulation of value‐at‐risk constrained optimization, 59
-
Nicklas Larsen, Helmut Mausser, S. Uryasev (2002)
ALGORITHMS FOR OPTIMIZATION OF VALUE AT-RISK* -
S. Benati, Romeo Rizzi (2007)
A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problemEur. J. Oper. Res., 176
-
A. Ruszczynski (2002)
Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedraMathematical Programming, 93
-
S. Sen (1992)
Relaxations for probabilistically constrained programs with discrete random variablesOper. Res. Lett., 11
-
J Birge, F Louveaux (1997)
Introduction in Stochastic programming -
A. Kibzun, O. Khromova (2014)
On reduction of the two-stage problem of quantile optimization to the problem of convex programmingAutomation and Remote Control, 75
-
AI Kibzun, AV Naumov (1995)
Guaranteed algorithm for solving the quantile optimization problem, 2
-
V. Norkin, S. Boyko (2012)
Safety-first portfolio selectionCybernetics and Systems Analysis, 48
-
James Luedtke, Shabbir Ahmed, G. Nemhauser (2007)
An integer programming approach for linear programs with probabilistic constraintsMathematical Programming, 122
-
V Norkin (2010)
On mixed integer reformulations of monotonic probabilistic programming problems with discrete distributions -
AN Shiryaev (1980)
Probability [in Russian] -
D. Wozabal, Ronald Hochreiter, G. Pflug (2010)
A difference of convex formulation of value-at-risk constrained optimizationOptimization, 59
-
V. Norkin, A. Kibzun, A. Naumov (2014)
Reducing Two-Stage Probabilistic Optimization Problems with Discrete Distribution of Random Data to Mixed-Integer Programming Problems*Cybernetics and Systems Analysis, 50
-
AI Kibzun, AV Naumov (1995)
A two‐stage quantile linear programming problem, 1
-
A. Naumov, I. Bobylev (2012)
On the two-stage problem of linear stochastic programming with quantile criterion and discrete distribution of the random parametersAutomation and Remote Control, 73
-
A. Kibzun, S. Uryasev (1998)
Differentiability of probability functionStochastic Analysis and Applications, 16
-
A. Kibzun, A. Naumov, V. Norkin (2013)
On reducing a quantile optimization problem with discrete distribution to a mixed integer programming problemAutomation and Remote Control, 74
-
VV Malyshev, AI Kibzun (1987)
Analysis and Synthesis of High‐Accuracy Control for Flying Vehicles [in Russian] -
A. Kibzun, O. Khromova (2014)
On reduction of the multistage problem of stochastic programming with quantile criterion to the problem of mixed integer linear programmingAutomation and Remote Control, 75
-
A. Kibzun, Yu. Kan (1996)
Stochastic Programming Problems with Probability and Quantile FunctionsJournal of the Operational Research Society, 48
- Publisher
- Wiley
- Copyright
- Copyright © 2015 John Wiley & Sons, Ltd.
- ISSN
- 1524-1904
- eISSN
- 1526-4025
- DOI
- 10.1002/asmb.2115
- Publisher site
- See Article on Publisher Site
Abstract
The paper is devoted to solving the two‐stage problem of stochastic programming with quantile criterion. It is assumed that the loss function is bilinear in random parameters and strategies, and the random vector has a normal distribution. Two algorithms are suggested to solve the problem, and they are compared. The first algorithm is based on the reduction of the original stochastic problem to a mixed integer linear programming problem. The second algorithm is based on the reduction of the problem to a sequence of convex programming problems. Performance characteristics of both the algorithms are illustrated by an example. A modification of both the algorithms is suggested to reduce the computing time. The new algorithm uses the solution obtained by the second algorithm as a starting point for the first algorithm. Copyright © 2015 John Wiley & Sons, Ltd.
Journal
Applied Stochastic Models in Business and Industry – Wiley
Published: Nov 1, 2015
Keywords: ; ; ; ; ; ;