Pseudo-invexity and symmetric duality in nonlinar programming

DOI10.1080/02331939408843920zbMath0819.90099OpenAlexW2083821784MaRDI QIDQ3835638

Laxminarayan Das, Sudarsan Nanda

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

symmetric dualitysymmetric dual nonlinear programming problemspseudo- invex functions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Duality theory (optimization) (49N15)

Related Items (6)

A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions ⋮ Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions ⋮ Symmetric and asymmetric duality ⋮ Technical note on symmetric duality in multiobjective programming: some remarks on recent results ⋮ Multiobjective symmetric duality with cone constraints

Cites Work

• Unnamed Item
• Optimality criteria in nonlinear programming involving nonconvex functions
• On sufficiency of the Kuhn-Tucker conditions
• Symmetric dual fractional programming
• Strong pseudo-convexity and symmetric duality in nonlinear programming
• What is invexity?
• On Symmetric Duality in Nonlinear Programming

This page was built for publication: Pseudo-invexity and symmetric duality in nonlinar programming