메뉴 건너뛰기




Volumn 60, Issue 2, 2004, Pages 331-346

Dual methods for probabilistic optimization problems

Author keywords

Convex programming; Duality; Liquidity constraints; Probabilistic constraints; Stochastic programming

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; SET THEORY; STOCHASTIC PROGRAMMING;

EID: 10044255579     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860400371     Document Type: Article
Times cited : (42)

References (16)
  • 1
    • 0001958747 scopus 로고    scopus 로고
    • Concavity and efficient points of discrete distributions in probabilistic programming
    • Dentcheva D, Prékopa A, Ruszczyński A (2000) Concavity and efficient points of discrete distributions in probabilistic programming, Mathematical Programming 89:55-77
    • (2000) Mathematical Programming , vol.89 , pp. 55-77
    • Dentcheva, D.1    Prékopa, A.2    Ruszczyński, A.3
  • 3
    • 10044238568 scopus 로고    scopus 로고
    • Duality gaps in nonconvex stochastic optimization
    • DOI: 10.1007/s10107-003-0496-1
    • Dentcheva D, Römisch W (2004) Duality gaps in nonconvex stochastic optimization, Mathematical Programming 100, DOI: 10.1007/s10107-003-0496-1
    • (2004) Mathematical Programming , vol.100
    • Dentcheva, D.1    Römisch, W.2
  • 5
    • 10044270511 scopus 로고    scopus 로고
    • Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
    • Dentcheva D, Ruszczyński A (2004) Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints, Mathematical Programming 99:329-350
    • (2004) Mathematical Programming , vol.99 , pp. 329-350
    • Dentcheva, D.1    Ruszczyński, A.2
  • 9
    • 0003323056 scopus 로고
    • Convex functions, monotone operators, and differentiability
    • Springer-Verlag
    • Phelps RR (1989) Convex functions, monotone operators, and differentiability, Lecture Notes in Mathematics 1364, Springer-Verlag
    • (1989) Lecture Notes in Mathematics , vol.1364
    • Phelps, R.R.1
  • 11
    • 0002873804 scopus 로고    scopus 로고
    • Programming under probabilistic constraint with discrete random variable
    • L. Grandinetti et al. (ed.), Kluwer, Dordrecht, Boston
    • Prékopa A, Vizvári B, Badics T (1998) Programming Under Probabilistic Constraint with Discrete Random Variable, in: New Trends in Mathematical Programming, L. Grandinetti et al. (ed.), Kluwer, Dordrecht, Boston, pp.235-255
    • (1998) New Trends in Mathematical Programming , pp. 235-255
    • Prékopa, A.1    Vizvári, B.2    Badics, T.3
  • 12
    • 0001377577 scopus 로고
    • On convexity of measures
    • Rinott Y (1976) On Convexity of Measures, Annals of Probability 4:1020-1026
    • (1976) Annals of Probability , vol.4 , pp. 1020-1026
    • Rinott, Y.1
  • 13
  • 14
    • 10044271668 scopus 로고    scopus 로고
    • Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
    • Ruszczyński A (2002) Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra, Mathematical Programming 93:195-215
    • (2002) Mathematical Programming , vol.93 , pp. 195-215
    • Ruszczyński, A.1
  • 16
    • 0141838626 scopus 로고    scopus 로고
    • Conditional value-at-risk: Optimization approach
    • Gainesville, FL, 2000, Appl. Optim., 54, Kluwer Academic Publishers, Dordrecht
    • Uryasev S, Rockafellar RT (2001) Conditional value-at-risk: optimization approach, in Stochastic optimization: algorithms and applications (Gainesville, FL, 2000), 411-435, Appl. Optim., 54, Kluwer Academic Publishers, Dordrecht
    • (2001) Stochastic Optimization: Algorithms and Applications , pp. 411-435
    • Uryasev, S.1    Rockafellar, R.T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.