Characterizing properties of approximate solutions for optimization problems

DOI10.1016/S0165-4896(99)00056-6zbMath0967.90095OpenAlexW2157809688WikidataQ127976824 ScholiaQ127976824MaRDI QIDQ5934224

S. H. Tijs, Fioravante Patrone, Henk Norde

Publication date: 3 September 2001

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-4896(99)00056-6

zbMATH Keywords

consistencyapproximate optimizationinvariance properties

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A generic approach to approximate efficiency and applications to vector optimization with set-valued maps ⋮ Axiomatic approach to approximate solutions in multiobjective optimization

Cites Work

• Well-posed optimization problems
• An extension of the Nash bargaining problem and the Nash social welfare function
• On the determinateness of semi-infinite bimatrix games
• Nash Equilibria for Noncooperative n-Person Games in Normal Form
• On the Determinateness of m × ∞-Bimatrix Games
• Rational Selection of Decision Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing properties of approximate solutions for optimization problems