A mixed integer programming model formulation for solving the lot-sizing problem

Maryam Mohammadi, Masine Md. Tap

Research output: Contribution to journalArticleScientificpeer-review

Abstract

This paper addresses a mixed integer programming (MIP)
formulation for the multi-item uncapacitated lot-sizing
problem that is inspired from the trailer manufacturer. The
proposed MIP model has been utilized to find out the
optimum order quantity, optimum order time, and the
minimum total cost of purchasing, ordering, and holding over
the predefined planning horizon. This problem is known as
NP-hard problem. The model was presented in an optimal
software form using LINGO 13.0.
Original languageEnglish
Pages (from-to)28-36
Number of pages9
JournalInternational Journal of Computer Science Issues
Volume9
Issue number2
Publication statusPublished - 2012
MoE publication typeA1 Journal article-refereed

Keywords

  • Lot-Sizing Problem
  • Mixed Integer Programming
  • Optimum Order Quantity
  • Purchasing Cost
  • Ordering Cost
  • Holding Cost

Fingerprint

Dive into the research topics of 'A mixed integer programming model formulation for solving the lot-sizing problem'. Together they form a unique fingerprint.

Cite this