Nonsmooth minimax fractional programming involvingη-pseudolinear functions

DOI10.1080/02331934.2012.689833zbMath1291.90174OpenAlexW2029677914MaRDI QIDQ5169456

B. B. Upadhyay, Shashi Kant Mishra

Publication date: 10 July 2014

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

locally Lipschitz functionsfractional minimax programming{\(\eta\)}-pseudolinear functions

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items (3)

New optimality conditions for a nondifferentiable fractional semipreinvex programming problem ⋮ Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity ⋮ Optimality conditions and duality for nondifferentiable multiobjective semi-infinite programming problems with generalized \((C,\alpha,\rho,d)\)-convexity

Cites Work

• Generalized pseudolinearity
• Necessary conditions and sufficient conditions for static minmax problems
• On invex sets and preinvex functions
• Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
• On characterizing solution set of non-differentiable η-pseudolinear extremum problem
• Pseudolinearity and efficiency
• Generalized Convexity in Nonlinear Programming
• Duality for Fractional Minimax Programming^∗∗The research is partly supported by NSC, Taiwan.$ef:
• Linear Programming Solutions to Ratio Games
• Best Rational Approximation and Strict Quasi-Convexity
• A characterization of strict local minimizers of order one for nonsmooth static minmax problems

This page was built for publication: Nonsmooth minimax fractional programming involvingη-pseudolinear functions