Accès ouvert
A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach
Résumé
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.
Citer ce document
Nyamugure, P., Munapo, E., Lesaoana, M., Kumar, S.
(2017). A Heuristic for a Mixed Integer Program using the Characteristic Equation Approach.
https://doi.org/10.33889/ijmems.2017.2.1-001
Accès au document
Voir sur le dépôt sourceCe document est hébergé sur son dépôt institutionnel d'origine.
Statistiques
Consultations : 3
Téléchargements : 0