On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity

DOI10.1007/978-1-4419-9640-4_9zbMath1247.90258OpenAlexW137011872MaRDI QIDQ2912153

No author found.

Publication date: 14 September 2012

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-9640-4_9

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Semi-infinite programming (90C34)

Cites Work

• Invexity and optimization
• On sufficiency of the Kuhn-Tucker conditions
• Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• V-invex functions and vector optimization.
• Semi-Infinite Programming: Theory, Methods, and Applications
• Pseudolinearity and efficiency
• Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
• Invex functions and constrained local minima
• On generalised convex mathematical programming
• On Nonlinear Fractional Programming
• Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
• Semi-infinite programming. Recent advances
• Unnamed Item

This page was built for publication: On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity