Bicriteria network flow problems: Continuous case
type: Item
instance of: scholarly article
title: Bicriteria network flow problems: Continuous case
zbMATH Open document ID: 0753.90028
DOI: 10.1016/0377-2217(91)90151-K
author: Haijune Lee
author: P. Simin Pulat
published in: European Journal of Operational Research
publication date: 1992-06-25T00:00:00Z
review text: An algorithm to solve bicriteria network flow problems with continuous variables is developed. First, an efficient extreme point is determined using the out-of-kilter method. Then, adjacent extreme points in the objective space are determined. A simple example is given. Possible extensions are discussed.
reviewed by: Eugenia Duca
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 14477
zbMATH Keywords: bicriteria network flow
zbMATH Keywords: out-of-kilter method
MaRDI profile type: Publication
cites work: Bicriteria Transportation Problem
cites work: Q4673630
cites work: Generating all maximal efficient faces for multiple objective linear programs
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: A general method for determining the set of all efficient solutions to a linear vectormaximum problem
cites work: Solving Bicriterion Mathematical Programs
cites work: Deterministic network optimization: A bibliography
cites work: Q5806966
cites work: Q3802859
cites work: Multiple Objective Linear Programming with Interval Criterion Weights
cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method
cites work: An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
full work available at URL: 0377-2217(91)90151-k
OpenAlex ID: W2094079836
description: scientific article; zbMATH DE number 14477