Premium
A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function
Author(s) -
Seshan C. R.,
Achary K. K.
Publication year - 1980
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.19800600804
Subject(s) - transportation theory , piecewise linear function , branch and bound , mathematical optimization , function (biology) , algorithm , schedule , piecewise , regular polygon , linear programming , convex function , frank–wolfe algorithm , mathematics , type (biology) , convex optimization , computer science , convex set , geometry , evolutionary biology , biology , mathematical analysis , ecology , operating system
A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.