Access the full text.
Sign up today, get DeepDyve free for 14 days.
A.L. Soyster (1973)
Convex programming with set-inclusive constraints and applications to inexact linear programmingOper. Res., 21
D. Goldfarb, G. Iyengar (2003)
Robust convex quadratically constrained programsMathematical Programming, 97
A. Ben-Tal, A. Nemirovski (1999)
Robust solutions of uncertain linear programsOper. Res. Lett., 25
D. Bertsimas, Melvyn Sim (2004)
The Price of RobustnessOper. Res., 52
A. Soyster (1973)
Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear ProgrammingOper. Res., 21
J.Y. Han, N.H. Xiu, H.D. Qi (2000)
Nonlinear complementarity theory and algorithm
A. Ben-Tal, Stephen Boyd, A. Nemirovski (2006)
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain ProblemsMathematical Programming, 107
G. Lin, Xiaojun Chen, M. Fukushima (2007)
New restricted NCP functions and their applications to stochastic NCP and stochastic MPECOptimization, 56
A. Ben-Tal, A. Nemirovski, Kees Roos (2002)
Robust Solutions of Uncertain Quadratic and Conic-Quadratic ProblemsSIAM J. Optim., 13
G. Gürkan, A. Özge, S. Robinson (1999)
Sample-path solution of stochastic variational inequalitiesMathematical Programming, 84
R. Cottle (2009)
Linear Complementarity Problem
A. Ben-Tal, A. Nemirovski (2000)
Robust solutions of Linear Programming problems contaminated with uncertain dataMathematical Programming, 88
A. Ben-Tal, A. Nemirovski (1998)
Robust Convex OptimizationMath. Oper. Res., 23
D. Goldfarb, G. Iyengar (2003)
Robust quadratically constrained programsMath. Program., 97
Xiaojun Chen, M. Fukushima (2005)
Expected Residual Minimization Method for Stochastic Linear Complementarity ProblemsMath. Oper. Res., 30
G. Lin, M. Fukushima (2006)
New reformulations for stochastic nonlinear complementarity problemsOptimization Methods and Software, 21
G.H. Lin, M. Fukushima (2006)
New reformulations for stochastic complementarity problemsOptim. Methods Softw., 21
In this paper, we adopt the robust optimization method to consider linear complementarity problems in which the data is not specified exactly or is uncertain, and it is only known to belong to a prescribed uncertainty set. We propose the notion of the ρ-robust counterpart and the ρ-robust solution of uncertain linear complementarity problems. We discuss uncertain linear complementarity problems with three different uncertainty sets, respectively, including an unknown-but-bounded uncertainty set, an ellipsoidal uncertainty set and an intersection-of-ellipsoids uncertainty set, and present some sufficient and necessary (or sufficient) conditions which ρ-robust solutions satisfy. Some special cases are investigated in this paper.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Sep 27, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.