Related references
Note: Only part of the references are listed.SOME CHARACTERIZATIONS OF ROBUST SOLUTION SETS FOR UNCERTAIN CONVEX OPTIMIZATION PROBLEMS WITH LOCALLY LIPSCHITZ INEQUALITY CONSTRAINTS
Nithirat Sisarat et al.
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION (2020)
Optimality Conditions for Approximate Pareto Solutions of a Nonsmooth Vector Optimization Problem with an Infinite Number of Constraints
Ta Quang Son et al.
ACTA MATHEMATICA VIETNAMICA (2020)
Characterizations of Solution Sets of Differentiable Quasiconvex Programming Problems
Vsevolod I. Ivanov
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2019)
A new approach to characterize the solution set of a pseudoconvex programming problem
T. Q. Son et al.
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS (2014)
ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
T. Q. Son et al.
JOURNAL OF GLOBAL OPTIMIZATION (2013)
ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints
T. Q. Son et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2009)
Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers
C. S. Lalitha et al.
OPTIMIZATION (2009)
Characterizations of optimal solution sets of convex infinite programs
T. Q. Son et al.
TOP (2008)
Approximate duality
C. Scovel et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2007)
New Farkas-type constraint qualifications in convex infinite programming
Nguyen Dinh et al.
ESAIM-CONTROL OPTIMISATION AND CALCULUS OF VARIATIONS (2007)
A new geometric condition for Fenchel's duality in infinite dimensional spaces
RS Burachik et al.
MATHEMATICAL PROGRAMMING (2005)
Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
V Jeyakumar et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2004)
Share Paper
