Existence of solutions for set optimization problems with variable ordering structures
From MaRDI portal
Cites work
- A topological convergence on power sets well-suited for set optimization
- Continuity of the solution set mappings to a parametric set optimization problem
- Convergence of solutions to set optimization problems with the set less order relation
- Convergence of the solution sets for set optimization problems
- Existence of weak efficient solutions of set-valued optimization problems
- Existence theorems for set optimization problems
- Global well-posedness of set-valued optimization with application to uncertain problems
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- scientific article; zbMATH DE number 5174522 (Why is no real title available?)
- Minimax type theorems for n-valued functions
- New order relations in set optimization
- Nonlinear scalarizations of set optimization problems with set orderings
- On scalarization and well-posedness in set optimization with a partial set order relation
- On set-valued optimization problems with variable ordering structure
- On solutions of set-valued optimization problems
- Optimality conditions for set-valued optimisation problems using a modified Demyanov difference
- Painlevé-Kuratowski convergences of the solution sets for set optimization problems with cone-quasiconnectedness
- Semicontinuity of the minimal solution mappings to parametric set optimization problems on Banach lattices
- Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach
- Set approach for set optimization with variable ordering structures. II: Scalarization approaches
- Set optimization and applications -- the state of the art. From set relations to set-valued risk measures
- Set-valued optimization. An introduction with applications
- Stability of efficient solutions to set optimization problems
- Stability of the approximate solution sets for set optimization problems with the perturbations of feasible set and objective mapping
- Strict weak l -efficient solutions for nonconvex set optimization problems
- The stability of the solution sets for set optimization problems via improvement sets
- Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization
- Variable ordering structures in vector optimization
- Weak Henig proper solution sets for set optimization problems
- Well-posedness of set optimization problems with set order defined by Minkowski difference
Cited in
(1)
This page was built for publication: Existence of solutions for set optimization problems with variable ordering structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933696)