A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach-Reference-Cited by-同舟云学术

A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach

Published:2017-03-01 Issue:1 Volume:2 Page:1-16
ISSN:2455-7749
Container-title:International Journal of Mathematical, Engineering and Management Sciences
language:en
Short-container-title:Int J Math, Eng, Manag Sci

Author:

Nyamugure Philimon,Munapo Elias,Lesaoana ‘Maseka,Kumar Santosh

Abstract

While most linear programming (LP) problems can be solved in polynomial time, pure and mixed integer problems are NP-hard and there are no known polynomial time algorithms to solve these problems. A characteristic equation (CE) was developed to solve a pure integer program (PIP). This paper presents a heuristic that generates a feasible solution along with the bounds for the NP-hard mixed integer program (MIP) model by solving the LP relaxation and the PIP, using the CE.

Publisher

International Journal of Mathematical, Engineering and Management Sciences plus Mangey Ram

Subject

General Engineering,General Business, Management and Accounting,General Mathematics,General Computer Science

Reference23 articles.

1. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252.

2. Borsani, V., Matta, A., Beschi, G., & Sommaruga, F. (2006, October). A home care scheduling model for human resources. In 2006 International Conference on Service Systems and Service Management (Vol. 1, pp. 449-454). IEEE.

3. Bredstrom, D., & Rönnqvist, M. (2007). A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. NHH Dept. of Finance & Management Science Discussion Paper, (2007/7).

4. Burer, S., & Letchford, A. N. (2012). Non-convex mixed-integer nonlinear programming, a survey. Surveys in Operations Research and Management Science, 17(2), 97-106.

5. Dey, S. S., & Vielma, J. P. (2010, June). The Chvátal-Gomory closure of an ellipsoid is a polyhedron. In International Conference on Integer Programming and Combinatorial Optimization (pp. 327-340). Springer Berlin Heidelberg.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Insight into the Characteristic Equation for an Integer Program;International Journal of Mathematical, Engineering and Management Sciences;2021-04-01

2. Optimal Capacity Allocation when Patients encounter Congestion in Primary Healthcare Network;International Journal of Mathematical, Engineering and Management Sciences;2019-04-01

3. A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model;International Journal of Mathematical, Engineering and Management Sciences;2017-12-01