Constraint qualifications in the invex case

DOI10.1080/02522667.1998.10699386zbMath0944.90086OpenAlexW2334697612MaRDI QIDQ4256752

Giorgio Giorgi, Angelo Guerraggio

Publication date: 2 August 1999

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1998.10699386

zbMATH Keywords

constraint qualificationsnonlinear programming problem

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

A class of \(r\)-semipreinvex functions and optimality in nonlinear programming

Cites Work

• Unnamed Item
• Optimality criteria in nonlinear programming involving nonconvex functions
• On sufficiency of the Kuhn-Tucker conditions
• Foundations of optimization
• What is invexity?
• Constraint qualifications in maximization problems
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization
• On constraint qualifications in nonlinear programming
• Constraint Qualifications Revisited

This page was built for publication: Constraint qualifications in the invex case