Duality for minmax programming involving nonsmooth v-invex functions

DOI10.1080/02331939608844249zbMath0870.49011OpenAlexW1968512870MaRDI QIDQ2785400

Viveka Kumar, C. R. Bector, Suresh Chandra

Publication date: 20 February 1997

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

generalized convexityoptimality conditionsMond-Weir duality\(V\)-invexityfractional programming dualitynonsmooth minmax programming

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Fractional programming (90C32) Existence of solutions for minimax problems (49J35) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (1)

A fifth bibliography of fractional programming^*

Cites Work

• Unnamed Item
• Unnamed Item
• Saddle-point type optimality criteria for generalized fractional programming
• Generalized fractional programming duality: A parametric approach
• Fractional programming - a survey
• Duality in generalized fractional programming via Farkas' lemma
• Duality in generalized nonlinear fractional programming
• Duality in generalized linear fractional programming
• Optimization and nonsmooth analysis
• On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
• On generalised convex mathematical programming
• Fractional programming without differentiability
• Generalized fractional programming duablity: a ratio game approach
• Best Rational Approximation and Strict Quasi-Convexity

This page was built for publication: Duality for minmax programming involving nonsmooth v-invex functions