Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
Repository logo
  • Colleges, Institutes & Collections
  • Browse AAU-ETD
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Genene, Aster"

Now showing 1 - 1 of 1
Results Per Page
Sort Options
  • No Thumbnail Available
    Item
    Mixed Integer Programming Approach for Inventory Distribution System
    (Addis Ababa University, 2020-12-12) Genene, Aster; Guta, Berhanu (PhD)
    Optimization is a mathematical problem that has many real-world applica- tions. It is used to determine minimizers or maximizers of a multi-variable real function, under a restricted domain. The thesis presented here aims in determining an optimal joint inventory with transportation proposed by [10]. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. A supply chain class which helps to determine joint transport and inventory cost does have a wide variety of advantages for both company and customer. One of the op- timization parts which is mixed integer programming is applied to nd the optimal solution to Joint Transportation-and-Inventory Problems (JTIPs) which portioning of customers as well as the route and date of delivery. Two mixed-integer programming models will be discussed: time-discretized inte- ger programming and the new approach with prede ned quantities of delivery with the date of delivery. As is shown in this thesis, the approach allows us to use a simplex method and the technique for solving mixed-integer program- ming i.e., branch and bound Method, and cutting plane method. Solution procedures are clearly illustrated based on a hypothetical applications and modi cation of the model are present in this thesis.

Home |Privacy policy |End User Agreement |Send Feedback |Library Website

Addis Ababa University © 2023