Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program

DOI10.2307/2581537zbMath0454.90075OpenAlexW4250670070MaRDI QIDQ3902847

Harold P. Benson

Publication date: 1981

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2581537

zbMATH Keywords

vector optimizationlinear multiple objective programsinitial efficient extreme point searchIsermann's method

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (19)

Optimizing a linear function over an efficient set ⋮ Random problem genertion and the computation of efficient extreme points in multiple objective linear programming ⋮ Generation of some methods for solving interval multi-objective linear programming models ⋮ Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems. ⋮ A new algorithm for linear multiobjective programming problems with bounded variables ⋮ Complete efficiency and the initialization of algorithms for multiple objective programming ⋮ A new method for determining all maximal efficient faces in multiple objective linear programming ⋮ A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons ⋮ Further analysis of an outcome set-based algorithm for multiple-objective linear programming ⋮ Hybrid approach for solving multiple-objective linear programs in outcome space ⋮ An Algorithm For Solving Multiple Objective Integer Linear Programming Problem ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ Outcome space partition of the weight set in multiobjective linear programming ⋮ A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program ⋮ Finding all maximal efficient faces in multiobjective linear programming ⋮ Determination of the efficient set in multiobjective linear programming ⋮ Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities

This page was built for publication: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program