Title: Comparison between linear programming and integer linear programming: a review
Authors: Mei Lee Sam; Adi Saptari; Mohd Rizal Bin Salleh; Effendi Mohamad
Addresses: Department of Manufacturing Management, Faculty of Manufacturing Engineering, Universiti Teknikal Malaysia Melaka, Melaka, Malaysia ' Department of Manufacturing Management, Faculty of Manufacturing Engineering, Universiti Teknikal Malaysia Melaka, Melaka, Malaysia ' Department of Manufacturing Management, Faculty of Manufacturing Engineering, Universiti Teknikal Malaysia Melaka, Melaka, Malaysia ' Department of Manufacturing Management, Faculty of Manufacturing Engineering, Universiti Teknikal Malaysia Melaka, Melaka, Malaysia
Abstract: This research discusses comparison of linear programming (LP) and integer linear programming (ILP). Two techniques to solve LP, simplex method and interior-point method were introduced. For ILP, available algorithms can be classified into exact algorithms and heuristic algorithms. Three criteria were used to evaluate the characteristics: time complexity, problem size and computational time. Simplex method is effective to solve small sized problems with less number of iterations while interior-point method was recommended for large sized problems due to its excellent performance and shorter computational time than simplex method. Exact algorithms are suitable for small sized problems and attain optimal solution in reasonable computational time. Meanwhile, heuristics outperform exact algorithms in solving large sized problem where it can obtain near optimal solution in an acceptable computational time. Heuristics are not guaranteed to obtain optimal solutions, compared to exact algorithms.
Keywords: linear programming; LP; integer linear programming; ILP; computational time; problem's size.
DOI: 10.1504/IJMOR.2018.092966
International Journal of Mathematics in Operational Research, 2018 Vol.13 No.1, pp.91 - 106
Received: 13 Jun 2016
Accepted: 09 Dec 2016
Published online: 04 Jul 2018 *