On trade-off solution pairs in a special type of transportation problem
The authors give an algorithm to generate efficient (trade-off) solutions for a bicriteria transportation problem in which a criterion is the usual linear cost objective and the other is the time of transportation. It is assumed that the time of transportation from an origin to a destination depends on the transported quantity. The time objective is a piecewise constant increasing function. A small numerical example, to illustrate the algorithm, is also given.
scientific article; zbMATH DE number 3854810