Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems

DOI10.1016/j.ejor.2007.04.026zbMath1142.90032WikidataQ126264950 ScholiaQ126264950MaRDI QIDQ2469580

Majid Soleimani-damaneh

Publication date: 6 February 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.026

zbMATH Keywords

Banach space; Lipschitz functions; generalized differentiation; weak *-topology; infinite mathematical programming

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C34: Semi-infinite programming

Related Items

Optimality and invexity in optimization problems in Banach algebras (spaces)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth multiobjective optimization using limiting subdifferentials
• Multiple-objective programs in Banach spaces: sufficiency for (proper) optimality
• Optimality criteria in mathematical programming involving generalized invexity
• On sufficiency of the Kuhn-Tucker conditions
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Recent contributions to linear semi-infinite optimization
• Second order symmetric duality in mathematical programming with \(F\)-convexity
• Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
• Nondifferentiable multiobjective programming under generalized \(d\)-univexity
• On generalised convex mathematical programming
• Variational Analysis
• Generalized invexity and duality in multiobjective programming problems