First Page | Document Content | |
---|---|---|
![]() Date: 2004-09-21 22:41:38Theoretical computer science Generalized semi-infinite programming Semi-infinite programming Robust optimization Convex optimization Constraint Optimization problem Combinatorial optimization Karush–Kuhn–Tucker conditions Mathematical optimization Mathematical analysis Mathematics | Source URL: www-2.dc.uba.arDownload Document from Source WebsiteFile Size: 105,70 KBShare Document on Facebook |
![]() | On the sufficiency of finite support duals in semi-infinite linear programming Amitabh Basua , Kipp Martinb , Christopher Thomas Ryanb a bDocID: 1nUGu - View Document |
![]() | Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming Amitabh Basu Kipp Martin Christopher Thomas Ryan March 17, 2014DocID: 1mFBE - View Document |
![]() | Interfacing NEOS from R The R package rneos Bernhard Pfaff Invesco Asset Management Deutschland GmbH, Frankfurt am MainDocID: 17OlZ - View Document |
![]() | Constrained global optimization Arnold Neumaier University of Vienna Vienna, AustriaDocID: 13o6j - View Document |
![]() | PDF DocumentDocID: muxF - View Document |