A convex-like duality scheme for quasi-convex programs
- 1 July 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 32 (3) , 278-300
- https://doi.org/10.1007/bf01582050
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Conjugacy in quasi-convex programmingMathematical Programming, 1984
- Duality theorems for certain programs involving minimum or maximum operationsMathematical Programming, 1979
- The Generalized Penalty-Function/Surrogate ModelOperations Research, 1973
- A Review of Quasi-Convex FunctionsOperations Research, 1971
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Surrogate Mathematical ProgrammingOperations Research, 1970
- Maximal separation theorems for convex setsTransactions of the American Mathematical Society, 1968
- Programming with linear fractional functionalsNaval Research Logistics Quarterly, 1962