Characterizing properties of approximate solutions for optimization problems
From MaRDI portal
Recommendations
- Axiomatic approach to approximate solutions in multiobjective optimization
- Approximative solutions of stochastic optimization problems
- Cone characterizations of approximate solutions in real vector optimization
- On approximate solutions in multiobjective optimization
- On some optimality principles in multicriterial problems
Cites work
- An extension of the Nash bargaining problem and the Nash social welfare function
- Game theory
- scientific article; zbMATH DE number 1600640 (Why is no real title available?)
- scientific article; zbMATH DE number 49749 (Why is no real title available?)
- scientific article; zbMATH DE number 3995381 (Why is no real title available?)
- scientific article; zbMATH DE number 3995480 (Why is no real title available?)
- Nash Equilibria for Noncooperative n-Person Games in Normal Form
- On the Determinateness of m × ∞-Bimatrix Games
- On the determinateness of semi-infinite bimatrix games
- Rational Selection of Decision Functions
- Well-posed optimization problems
Cited in
(4)- Axiomatic approach to approximate solutions in multiobjective optimization
- Intractability and approximation of optimization theories of cognition
- scientific article; zbMATH DE number 7640094 (Why is no real title available?)
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps
This page was built for publication: Characterizing properties of approximate solutions for optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5934224)
