Surrogate duality for robust optimization

この論文にアクセスする

この論文をさがす

抄録

Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min-max duality theorems for robust convex opti-mization problems. We give necessary and sufficient constraint qualifications for surrogate duality and surrogate min-max duality, and show some exam-ples at which such duality results are used effectively. Moreover, we obtain a surrogate duality theorem and a surrogate min-max duality theorem for semi-definite optimization problems in the face of data uncertainty.

収録刊行物

  • European Journal of Operational Research

    European Journal of Operational Research 231(2), 257-262, 2013-12-01

各種コード

  • NII論文ID(NAID)
    120005647348
  • NII書誌ID(NCID)
    AA0017802X
  • 本文言語コード
    ENG
  • 資料種別
    journal article
  • ISSN
    0377-2217
  • データ提供元
    IR 
ページトップへ