Characterizations of optimal solution sets of convex infinite programs
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
- Jeyakumar, V. & Lee, G.M. & Dinh, N., 2006. "Characterizations of solution sets of convex vector minimization problems," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1380-1395, November.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- T. Son & D. Kim, 2013. "ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints," Journal of Global Optimization, Springer, vol. 57(2), pages 447-465, October.
- T. Son & D. Kim & N. Tam, 2012. "Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian," Journal of Global Optimization, Springer, vol. 53(2), pages 165-184, June.
More about this item
KeywordsConvex infinite programs; Lagrange multipliers; Solution sets; Semi-convex programs; 90C25; 90C26; 90C32; 90C46;
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:16:y:2008:i:1:p:147-163. 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 .