|
[1]
|
Dentcheva, D., Prékopa, A. and Ruszczynski, A. (2000) Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming. Mathematical Programming, 89, 55-77. [Google Scholar] [CrossRef]
|
|
[2]
|
Dentcheva, D., Prékopa, A. and Ruszczyński, A. (2002) Bounds for Probabilistic Integer Programming Problems. Discrete Applied Mathematics, 124, 55-65. [Google Scholar] [CrossRef]
|
|
[3]
|
Dentcheva, D., Lai, B. and Ruszczyński, A. (2004) Dual Methods for Probabilistic Optimization Problems. Mathematical Methods of Operational Research, 60, 331-346. [Google Scholar] [CrossRef]
|
|
[4]
|
Luedtke, J., Ahmed, S. and Nemhauser, G.L. (2008) An Integer Programming Approach for Linear Programs with Probabilistic Constraints. Mathematical Programming, 122, 247-272. [Google Scholar] [CrossRef]
|
|
[5]
|
Dentcheva, D. and Martinez, G. (2011) Augmented Lagrangian Method for Probabilistic Optimization. Annals of Operations Research, 200, 109-130. [Google Scholar] [CrossRef]
|
|
[6]
|
Hestenes, M.R. (1969) Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4, 303-320. [Google Scholar] [CrossRef]
|
|
[7]
|
Powell, M.J.D. (1969) A Method for Nonlinear Constraints in Minimization Problems. In: Fletcher, R. Ed., Optimization, Academic Press, 283-298.
|
|
[8]
|
Boggs, P.T. and Tolle, J.W. (1980) Augmented Lagrangians Which Are Quadratic in the Multiplier. Journal of Optimization Theory and Applications, 31, 17-26. [Google Scholar] [CrossRef]
|
|
[9]
|
Bertsekas, D.P. (1982) Constrained Optimization and Lagrange Multiplier Methods. Academic Press.
|
|
[10]
|
Polyak, R. (1992) Modified Barrier Functions (Theory and Methods). Mathematical Programming, 54, 177-222. [Google Scholar] [CrossRef]
|