Pages that link to "Item:Q1150307"
From MaRDI portal
The following pages link to A simplex based algorithm for the lexicographically extended linear maxmin problem (Q1150307):
Displaying 17 items.
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions (Q752006) (← links)
- Applications of fuzzy set theory to mathematical programming (Q1066822) (← links)
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions (Q1080368) (← links)
- An interactive fuzzy programming system (Q1097174) (← links)
- Interactive multiple objective programming subject to flexible constraints (Q1098782) (← links)
- Two-phase approach for solving the fuzzy linear programming problems (Q1125337) (← links)
- Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (Q1278742) (← links)
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems (Q1307812) (← links)
- Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints (Q1885750) (← links)
- Finding the nucleolus of the vehicle routing game with time windows (Q1988954) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Beam selection in radiotherapy design (Q2472377) (← links)
- Analytic solution for the nucleolus of a three-player cooperative game (Q3065628) (← links)
- Leximin optimality and fuzzy set-theoretic operations. (Q5932021) (← links)
