Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
From MaRDI portal
Publication:1384421
zbMath0895.90164MaRDI QIDQ1384421
Publication date: 13 April 1998
Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)
Related Items (10)
Unnamed Item ⋮ Adjacency based method for generating maximal efficient faces in multiobjective linear programming ⋮ Stochastic optimization over a Pareto set associated with a stochastic multi-objective optimization problem ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ Necessary optimality conditions for semi-vectorial bi-level optimization with convex lower level: theoretical results and applications to the quadratic case ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case
This page was built for publication: Generating the efficient outcome set in multiple objective linear programs: The bicriteria case
