Pages that link to "Item:Q1265180"
From MaRDI portal
The following pages link to An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem (Q1265180):
Displaying 41 items.
- A linear risk-return model for enhanced indexation in portfolio optimization (Q2516640) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- A new exact method for linear bilevel problems with multiple objective functions at the lower level (Q2673580) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs (Q2805756) (← links)
- PolySCIP (Q2819226) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
- A deterministic algorithm for global multi-objective optimization (Q2926067) (← links)
- Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy (Q2935310) (← links)
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
- Multiobjective (Combinatorial) Optimisation—Some Thoughts on Applications (Q3649619) (← links)
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS (Q4548050) (← links)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
- Generation of efficient and ε -efficient solutions in multiple objective linear programming (Q4634220) (← links)
- Primal and dual algorithms for optimization over the efficient set (Q4646523) (← links)
- (Q4963438) (← links)
- AN ALGORITHM FOR CALCULATING THE SET OF SUPERHEDGING PORTFOLIOS IN MARKETS WITH TRANSACTION COSTS (Q4979885) (← links)
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
- Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint (Q5139847) (← links)
- Компромиссные паретовские оценки параметров линейной регрессии (Q5141836) (← links)
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver (Q5198001) (← links)
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets (Q5745164) (← links)
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
- Mathematical optimization in intensity modulated radiation therapy (Q5900895) (← links)
- Mathematical optimization in intensity modulated radiation therapy (Q5902146) (← links)
- Using multiobjective optimization to map the entropy region (Q5963309) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
- Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)
- A framework for controllable Pareto front learning with completed scalarization functions and its applications (Q6148441) (← links)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm (Q6587338) (← links)
- Computing the recession cone of a convex upper image via convex projection (Q6593832) (← links)
- Polyhedral approximation method for reachable sets of linear delay systems (Q6598783) (← links)
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems (Q6614703) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem (Q6616276) (← links)
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems (Q6616278) (← links)
- Deep learning the efficient frontier of convex vector optimization problems (Q6618150) (← links)
