Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem

DOI10.1287/OPRE.25.1.163zbMath0383.90076OpenAlexW2043332393MaRDI QIDQ4162965

Theodore S. Glickman, Paul D. Berger

Publication date: 1977

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.25.1.163

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (13)

Constructing the set of efficient objective values in linear multiple objective transportation problems ⋮ Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options ⋮ Efficiency and time-cost-tradeoffs in transportation problems ⋮ Bi-criteria transportation problem with multiple parameters ⋮ The transportation problem with objective of simultaneous minimization of total transportation cost and transportation time to each destination. ⋮ Pareto optimal solutions of a cost-time trade-off bulk transportation problem ⋮ Bicriteria bottleneck linear programming problem ⋮ Time-cost Trade-off Relations in Bulk Transportation Problem ⋮ Unnamed Item ⋮ On quadratic fractional generalized solid bi-criterion transportation problem ⋮ On trade-off solution pairs in a special type of transportation problem ⋮ Solving Bottleneck Bi-criteria Transportation Problems ⋮ Total shipping cost/completion-date trade-off in transportation problem with additional restriction

This page was built for publication: Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem