Bicriteria network flow problems: Continuous case (Q1175771): Difference between revisions

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.

0 references

reviewed by

E.Duca

0 references

zbMATH Keywords

bicriteria network flow

0 references

out-of-kilter method

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Bicriteria Transportation Problem

0 references

Q4673630

0 references

Generating all maximal efficient faces for multiple objective linear programs

0 references

Finding all efficient extreme points for multiple objective linear programs

0 references

A general method for determining the set of all efficient solutions to a linear vectormaximum problem

0 references

Solving Bicriterion Mathematical Programs

0 references

Deterministic network optimization: A bibliography

0 references

Q5806966

0 references

Q3802859

0 references

Multiple Objective Linear Programming with Interval Criterion Weights

0 references

The set of all nondominated solutions in linear cases and a multicriteria simplex method

0 references

An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions

0 references

Identifiers

zbMATH Open document ID

0753.90028

0 references

DOI

10.1016/0377-2217(91)90151-K

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1175771

@@ Property / cites work @@
+Bicriteria Transportation Problem
@@ Property / cites work: Bicriteria Transportation Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4673630
@@ Property / cites work: Q4673630 / rank @@
+Normal rank
@@ Property / cites work @@
+Generating all maximal efficient faces for multiple objective linear programs
+Normal rank
@@ Property / cites work @@
+Finding all efficient extreme points for multiple objective linear programs
+Normal rank
@@ Property / cites work @@
+A general method for determining the set of all efficient solutions to a linear vectormaximum problem
+Normal rank
@@ Property / cites work @@
+Solving Bicriterion Mathematical Programs
@@ Property / cites work: Solving Bicriterion Mathematical Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic network optimization: A bibliography
+Normal rank
@@ Property / cites work @@
+Q5806966
@@ Property / cites work: Q5806966 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3802859
@@ Property / cites work: Q3802859 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple Objective Linear Programming with Interval Criterion Weights
+Normal rank
@@ Property / cites work @@
+The set of all nondominated solutions in linear cases and a multicriteria simplex method
+Normal rank
@@ Property / cites work @@
+An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
+Normal rank