CD Skripsi
Model Penugasan Sebagai Masalah Program Linear Bilangan Bulat Campuran Untuk Menentukan Kebijakan Persediaan Optimal
This final project discusses of the multi-item inventory problem with
backorder using assignment model as mixed integer linear programming
problem with branch-and-bound method. This model aims to determine
optimal policy of inventory problem by meeting the specified constrains.
The mathematical model for this problem is designed using the LINGO 18.0
application. The solution of the assignment model is compared with EOQ
multi-item model with backorder. Based of the comparison of the two models,
it is concluded that the assignment model as mixed integer linear programming
problems are more efficient in minimizing generalize a company’s inventory
costs and can be considered to obtain an optimal inventory policy.
Keywords: Backorder, inventory problem, mixed integer linear programming
problem, branch-and-bound method, assignment model
vi
Tidak tersedia versi lain