Approximate saddle points for constrained vector-valued games.

DOI10.1007/BF03398619zbMATH Open1141.91314OpenAlexW2774572322MaRDI QIDQ2468641FDOQ2468641

Authors: L. Venkateswara Reddy, R. N. Mukherjee 

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

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

Cites Work

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

Cited In (1)

• Approximate saddle points for minmax problems and vector valued games.

This page was built for publication: Approximate saddle points for constrained vector-valued games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468641)