Pages that link to "Item:Q2408519"
From MaRDI portal
The following pages link to A Benson type algorithm for nonconvex multiobjective programming problems (Q2408519):
Displaying 12 items.
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization (Q829338) (← links)
- A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
- An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)
- Existence results and optimization over the set of efficient solutions in vector-valued approximation theory (Q6085815) (← links)
- Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
- A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem (Q6559157) (← links)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
