Premium
Backordering in a multiperiod transshipment network
Author(s) -
Sandbothe Richard A.
Publication year - 1993
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230230705
Subject(s) - transshipment (information security) , mathematical optimization , constraint (computer aided design) , piecewise linear function , node (physics) , computer science , flow network , set (abstract data type) , integer programming , integer (computer science) , linear programming , flow (mathematics) , piecewise , mathematics , operations research , engineering , geometry , structural engineering , programming language , mathematical analysis
Abstract This paper demonstrates that when the backordering of demand is permitted in a Multiperiod Transshipment Problem it is necessary to include additional side constraints that restrict the number of backorders a node can have in a time period. Computer experience on a small set of test problems is presented to validate this problem formulation. Two stricter backorder constraint sets are also presented, both of which are piecewise linear. For these piecewise linear constraint cases, a method is outlined whereby the original network problem is transformed into a mixed integer linear network flow problem that is very difficult to solve. Some highlights of work by other authors in solving mixed integer linear network flow problems are given. © 1993 by John Wiley & Sons, Inc.