Search over the Integer Polyhedron for a Pure Integer Program

Full text for this resource is not available from the Research Repository.

Munapo, Elias, Kumar, Santosh and Khan, Lutfar R (2010) Search over the Integer Polyhedron for a Pure Integer Program. AIMS International Journal of Management , 4 (2). pp. 107-116. ISSN 1939-7011


This paper presents a search procedure similar to the simplex method of linear programming for a pure integer-programming model over the integer polyhedron formed by the linear constraints. Young [13, 14] developed, for the first time, a method that also searched for the optimal solution over the integer polyhedron but surprisingly this method has not received as much attention as other methods have. In this short note a new search procedure over the integer polyhedron has been described. This proposed method is different and developed independently. This method has been compared to the Young’s approach. Unlike the Young’s approach where partial history of computations is dropped from further considerations, the proposed approach retains all its history and therefore may prove useful for information recycling in IP. In the end illustrative examples are given.

Item type Article
Subjects Historical > Faculty/School/Research Centre/Department > School of Engineering and Science
Historical > FOR Classification > 1503 Business and Management
Historical > SEO Classification > 970101 Expanding Knowledge in the Mathematical Sciences
Keywords ResPubID20415, pure integer Program, integer convex polyhedron
Download/View statistics View download statistics for this item

Search Google Scholar

Repository staff login