Duality for minmax programming involving nonsmooth v-invex functions

DOI10.1080/02331939608844249zbMath0870.49011MaRDI QIDQ2785400

C. R. Bector, Suresh Chandra, Viveka Kumar

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 convexity; optimality conditions; Mond-Weir duality; \(V\)-invexity; fractional programming duality; nonsmooth minmax programming

Mathematics Subject Classification ID

49J52: Nonsmooth analysis

90C32: Fractional programming

49J35: Existence of solutions for minimax problems

49N15: Duality theory (optimization)

26B25: Convexity of real functions of several variables, generalizations

Related Items

A fifth bibliography of fractional programming^*

Cites Work

• Unnamed Item
• 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
• 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