Numerical Functional Analysis and Optimization · 2019 · 37 citations · 24 references
Natural SciencesMathematicsDesign OptimizationMulti-criteria Decision MakingOptimizationConstrained OptimizationConvex AnalysisConvex OptimizationMultiobjective OptimizationNonlinear ProgrammingOptimization TheoryConstraint QualificationsDuality TheoremDuality TheoryKarush-kuhn-tucker ConditionsLagrangian DualityOptimality ConditionsSemi-infinite ProgrammingStrong Duality
The aim of this article is to study Karush-Kuhn-Tucker optimality conditions and duality for nonsmooth multiobjective semi-infinite programing (MSIP). By using tangential subdifferentials and suitable generalized constraint qualifications, we establish necessary and sufficient optimality conditions for some types of efficient solutions of the MSIP. We also propose Wolfe and Mond-Weir type duality for the MSIP and explore weak and strong duality relations under generalized convexity.
24
A duality theorem for non-linear programming
Philip Wolfe · Quarterly of Applied Mathematics · 1961 · 585 citations · Full text
Nonconvex Optimization and Its Applications
Pãnos M. Pardalos, Shashi Kant Mishra, Shouyang Wang et al. · 2008 · 533 citations
Necessary Conditions for an Extremum
E. Polak, B. N. Pshenichnyĭ · Mathematics of Computation · 1972 · 383 citations
A Duality Theorem for Nonlinear Programming
Skand Sinha · Management Science · 1966 · 350 citations