On Generalized Constrained Optimization and Separation Theorems
AbstractIn this paper a generalized format for a constrained extremum problem is considered. Subsequently, the paper investigates and deepens some aspects concerning the linear separation between two sets in the Euclidean space, that are a convex cone and a generic set. A condition equivalent to their linear separation is given. Moreover, a condition equivalent to regular linear separation is proposed; this condition includes also the nonconvex case and it is finalized to the application to the generalized constrained extremum problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Verona, Department of Economics in its series Working Papers with number 64/2009.
Date of creation: Oct 2009
Date of revision:
Separation; optimality conditions.;
Find related papers by JEL classification:
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-11-21 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Michael Reiter).
If references are entirely missing, you can add them using this form.