The enumeration of all efficient solutions for a linear multiple‐objective transportation problem

Heinz Isermann

Naval Research Logistics Quarterly · 1979 · 118 citations · 5 references

Concepts

Abstract

Abstract An algorithm is presented by which the set of all efficient solutions for a linear multiple‐objective transportation problem can be enumerated. First the algorithm determines an initial efficient basic solution. In a second step all efficient basic solutions are enumerated. Finally, the set of all efficient solutions is constructed as a union of a minimal number of convex sets of efficient solutions. The algorithm is illustrated by a numerical example.

References

5