Conjugacy in quasi-convex programming
- 1 October 1984
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 30 (2), 121-146
- https://doi.org/10.1007/bf02591881
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Duality theorems for certain programs involving minimum or maximum operationsMathematical Programming, 1979
- Conditions for an extremum of a functional in case of constraintsCybernetics and Systems Analysis, 1975
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Maximal separation theorems for convex setsTransactions of the American Mathematical Society, 1968