A calculation approach to scalarization for polyhedral sets by means of set relations
From MaRDI portal
Publication:1722087
DOI10.11650/tjm/180703zbMath1406.90113OpenAlexW2883674332MaRDI QIDQ1722087
Tamaki Tanaka, Yuto Ogata, Koichiro Ike, Hui Yu
Publication date: 14 February 2019
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1532333185
Cites Work
- Unnamed Item
- Pointwise well-posedness in set optimization with cone proper sets
- Four types of nonlinear scalarizations and some applications in set optimization
- Well-setness and scalarization in set optimization
- Nonlinear scalarization functions and polar cone in set optimization
- New order relations in set optimization
- Nonconvex scalarization in set optimization with set-valued maps
- Well-posedness for set optimization problems
- Variational methods in partially ordered spaces
- Computational methods for set-relation-based scalarizing functions
- Scalarization in set optimization with solid and nonsolid ordering cones
- Fourier-Motzkin elimination and its dual
- A new nonlinear scalarization function and applications
- Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization
- Convex-cone-based comparisons of and difference evaluations for fuzzy sets
- An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets
- Lectures on Polytopes
- On cone convexity of set-valued maps
This page was built for publication: A calculation approach to scalarization for polyhedral sets by means of set relations