ISSN:
1436-4646
Keywords:
90C25
;
90C29
;
Constraint qualification
;
convex program
;
optimality condition
;
multi-objective program
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We introduce and characterize a class of differentiable convex functions for which the Karush—Kuhn—Tucker condition is necessary for optimality. If some constraints do not belong to this class, then the characterization of optimality generally assumes an asymptotic form. We also show that for the functions that belong to this class in multi-objective optimization, Pareto solutions coincide with strong Pareto solutions,. This extends a result, well known for the linear case.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01582159
Permalink