Implicit optimality criterion for convex SIP problem with box constrained index set
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Still, G., 1999. "Generalized semi-infinite programming: Theory and methods," European Journal of Operational Research, Elsevier, vol. 119(2), pages 301-313, December.
- Tijs, S.H., 1979. "Semi-infinite linear programs and semi-infinite matrix games," Other publications TiSEM 3e08d5e1-de1d-45b2-81b3-3, Tilburg University, School of Economics and Management.
More about this item
KeywordsSemi-infinite programming (SIP); Semidefinite programming (SDP); Constraint qualifications (CQ); Immobile index; Optimality conditions; 90C25; 90C30; 90C34;
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:2:p:475-502. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .