Weighting factor extensions for finite multiple objective vector minimization problems

DOI10.1016/0377-2217(88)90433-XzbMath0651.90080OpenAlexW2091395454MaRDI QIDQ1106737

Douglas J. White

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90433-x

zbMATH Keywords

efficient setmulti-objective problemweighting factordiscrete set of feasible actions

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (6)

Quadratic scalarization for decomposed multiobjective optimization ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method ⋮ Minimax reference point approach and its application for multiobjective optimisation ⋮ Convexification of a noninferior frontier ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality and efficiency. I
• Linear multiobjective programming
• The shortest route problem with constraints
• Shortest chain subject to side constraints
• An Algorithm for Finding K Minimum Spanning Trees
• Two Algorithms for Generating Weighted Spanning Trees in Order
• A revised simplex method for linear multiple objective programs
• Optimum branchings
• An Appraisal of Some Shortest-Path Algorithms
• Extreme Point Mathematical Programming

This page was built for publication: Weighting factor extensions for finite multiple objective vector minimization problems