Pages that link to "Item:Q1027447"
From MaRDI portal
The following pages link to An exact method for computing the nadir values in multiple objective linear programming (Q1027447):
Displaying 11 items.
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
- Characterizing coherence, correcting incoherence (Q473384) (← links)
- Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
- On nadir points of multiobjective integer programming problems (Q1683328) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming (Q2267661) (← links)
- Finding nadir points in multi-objective integer programs (Q2350074) (← links)
- Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
- A new exact method for linear bilevel problems with multiple objective functions at the lower level (Q2673580) (← links)
