A note on duality in reverse convex optimization
- 22 January 2024
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 73 (12) , 3643-3651
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex ProblemsNumerical Functional Analysis and Optimization, 2014
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex ConstraintsSIAM Journal on Optimization, 2003
- Lagrangian duality theorems for reverse convex infimizationNumerical Functional Analysis and Optimization, 2000
- Duality in D.C. Programming: The Case of Several D.C. ConstraintsJournal of Mathematical Analysis and Applications, 1999
- Duality in Reverse Convex OptimizationSIAM Journal on Optimization, 1998
- Theorems of the Alternative and Duality for INF-SUP ProblemsMathematics of Operations Research, 1994
- Some further duality theorems for optimization problems with reverse convex constraint setsJournal of Mathematical Analysis and Applications, 1992
- Inequality systems and optimizationJournal of Mathematical Analysis and Applications, 1991
- Mathematical programs with a two-dimensional reverse convex constraintJournal of Global Optimization, 1991
- Reverse convex programmingApplied Mathematics & Optimization, 1980