Approximate saddle points for constrained vector-valued games.

DOI10.1007/BF03398619zbMath1141.91314OpenAlexW2774572322MaRDI QIDQ2468641

R. N. Mukherjee, L. Venkateswara Reddy

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Noncooperative games (91A10) Multi-objective and goal programming (90C29)

Related Items

Approximate saddle points for minmax problems and vector valued games.

Cites Work

• \(\epsilon\)-solutions in vector minimization problems
• Epsilon efficiency
• \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
• Epsilon approximate solutions for multiobjective programming problems
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• Approximate saddle points for minmax problems and vector valued games.
• ε-Optimal solutions in nondifferentiable convex programming and some related questions