Mixed Integer Programming Approach For Inventory Distribution System

Optimization is a mathematical problem that has many real-world applica-rntions. It is used to determine minimizers or maximizers of a multi-variablernreal function, under a restricted domain. The thesis presented here aims inrndetermining an optimal joint inventory with transportation proposed by [10].rnThese problems are characterized by the presence of both transportation andrninventory considerations, either as parameters or constraints. A supply chainrnclass which helps to determine joint transport and inventory cost does haverna wide variety of advantages for both company and customer. One of the op-rntimization parts which is mixed integer programming is applied to nd thernoptimal solution to Joint Transportation-and-Inventory Problems (JTIPs)rnwhich portioning of customers as well as the route and date of delivery. Twornmixed-integer programming models will be discussed: time-discretized inte-rnger programming and the new approach with prede ned quantities of deliveryrnwith the date of delivery. As is shown in this thesis, the approach allows us tornuse a simplex method and the technique for solving mixed-integer program-rnming i.e., branch and bound Method, and cutting plane method. Solutionrnprocedures are clearly illustrated based on a hypothetical applications andrnmodi cation of the model are present in this thesis.

Get Full Work

Report copyright infringement or plagiarism