Pages that link to "Item:Q691482"
From MaRDI portal
The following pages link to Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming (Q691482):
Displaying 16 items.
- On multi-objective optimization aided drawing of special graphs (Q299425) (← links)
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem (Q299429) (← links)
- On the worst-case optimal multi-objective global optimization (Q395864) (← links)
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation (Q445451) (← links)
- Bi-objective hypervolume-based Pareto optimization (Q497433) (← links)
- A weighting subgradient algorithm for multiobjective optimization (Q1744637) (← links)
- Approximating the Pareto set of multiobjective linear programs via robust optimization (Q1758268) (← links)
- A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization (Q2023258) (← links)
- A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems (Q2046554) (← links)
- Stock portfolio selection hybridizing fuzzy base-criterion method and evidence theory in triangular fuzzy environment (Q2079294) (← links)
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization (Q2095643) (← links)
- A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization (Q2378257) (← links)
- A new trisection method for solving Lipschitz bi-objective optimization problems (Q2666322) (← links)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
- Branch and probability bound methods in multi-objective optimization (Q5963235) (← links)
- Goal programming with extended factors for portfolio selection (Q6088210) (← links)
