Partial vector invexity and fractional minmax problem

DOI10.1007/BF03398695zbMath1210.90150OpenAlexW2771399043MaRDI QIDQ2477101

Davinder Bhatia, Hitesh Arora

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398695

zbMATH Keywords

dualityinvexityminimax problemfractional problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for generalized fractional programs
• Generalized fractional programming duality: A parametric approach
• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• On sufficiency of the Kuhn-Tucker conditions
• Optimization and nonsmooth analysis
• Duality for minmax programming involvingV-invex functions

This page was built for publication: Partial vector invexity and fractional minmax problem