On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming

この論文をさがす

抄録

Dual characterizations of the containment of a convex set with qua-siconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.

収録刊行物

詳細情報 詳細情報について

  • CRID
    1050564288439493888
  • NII論文ID
    120005647349
  • NII書誌ID
    AA00253056
  • ISSN
    00223239
  • Web Site
    http://ir.lib.shimane-u.ac.jp/32752
  • 本文言語コード
    en
  • 資料種別
    journal article
  • データソース種別
    • IRDB
    • CiNii Articles

問題の指摘

ページトップへ