Solutions for a class of invex programming problems

DOI10.1080/03610929008830435MaRDI QIDQ3354475zbMATH OpenOpenAlexFDO

Authors Morgan A. Hanson

Publication date 1990

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

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

zbMATH Keywords

generalized polynomialsinvex programminginvexity kernelnonconvex constrained optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Generalized invexity-type conditions in constrained optimization
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• Generalized Convexity in Nonlinear Programming
• scientific article; zbMATH DE number 1880839
• Invex programming problems with equality and inequality constraints

Cites work

• A sufficient condition for invexity
• Invex functions and constrained local minima
• Necessary and sufficient conditions in constrained optimization
• On sufficiency of the Kuhn-Tucker conditions
• What is invexity?

Cited in

(2)

• On some badly-solved problems with invexity
• Invex functions and their application to mathematical programming

This page was built for publication: Solutions for a class of invex programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354475)