Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program

DOI10.1080/02522667.1989.10698961zbMath0676.90083OpenAlexW2039117072MaRDI QIDQ3832346

C. R. Bector, M. K. Bector

Publication date: 1989

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionsgeneralized minmax programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Fractional programming (90C32) Duality theory (optimization) (49N15) Optimality conditions for minimax problems (49K35)

Cites Work

• Unnamed Item
• An algorithm for generalized fractional programs
• Generalized fractional programming: Algorithms and numerical experimentation
• A note on an algorithm for generalized fractional programs
• On various duality theorems in nonlinear programming
• On sufficiency of the Kuhn-Tucker conditions
• Duality in generalized fractional programming via Farkas' lemma
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Strong and Weak Convexity of Sets and Functions
• Duality in generalized linear fractional programming
• Invex functions and constrained local minima
• Fractional Programming. I, Duality
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
• On Nonlinear Fractional Programming
• Seven Kinds of Convexity
• Linear Programming Solutions to Ratio Games

This page was built for publication: Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program