Weighting factor extensions for finite multiple objective vector minimization problems
type: Item
instance of: scholarly article
title: Weighting factor extensions for finite multiple objective vector minimization problems
zbMATH Open document ID: 0651.90080
DOI: 10.1016/0377-2217(88)90433-X
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
review text: The author discusses the problem of finding vector minima in problems with a discrete set of feasible actions. He explores two approaches which extend the standard weighting factor approach and uses a simple example to demonstrate them, while recognizing that the essential task of converting them to effective computational procedures remains.
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 4062848
zbMATH Keywords: multi-objective problem
zbMATH Keywords: efficient set
zbMATH Keywords: discrete set of feasible actions
zbMATH Keywords: weighting factor
author: D. J. White
reviewed by: Guanggan Chen
MaRDI profile type: Publication
cites work: Optimum branchings
cites work: Q3844775
cites work: Q5611539
cites work: A revised simplex method for linear multiple objective programs
cites work: Optimality and efficiency. I
cites work: The shortest route problem with constraints
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Two Algorithms for Generating Weighted Spanning Trees in Order
cites work: An Algorithm for Finding K Minimum Spanning Trees
cites work: Shortest chain subject to side constraints
cites work: Linear multiobjective programming
cites work: Extreme Point Mathematical Programming
full work available at URL: 0377-2217(88)90433-x
OpenAlex ID: W2091395454
description: scientific article; zbMATH DE number 4062848