Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem

DOI10.1080/02522667.2000.10699434zbMath0944.90097OpenAlexW2030099148MaRDI QIDQ4943239

J. Zhang

Publication date: 16 March 2000

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

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

zbMATH Keywords

duality theoremsminmax programming problemminmax generalized fractional programming problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Unnamed Item
• An algorithm for generalized fractional programs
• Saddle-point type optimality criteria for generalized fractional programming
• Generalized fractional programming duality: A parametric approach
• On sufficiency of the Kuhn-Tucker conditions
• Duality in generalized fractional programming via Farkas' lemma
• B-vex functions
• Generalized B-vex functions and generalized B-vex programming
• Wolfe-type duality involving \((B,\eta)\)-index functions for a minimax programming problem
• Duality for multiobjective \(B\)-vex programming involving \(n\)-set functions
• Vector-valued lagrangian and multiobjective fractional programming duality
• What is invexity?
• On generalised convex mathematical programming
• Generalized fractional programming duablity: a ratio game approach
• Duality for minmax programming involvingV-invex functions