A swift approach to decode Integer programming problems using CMI’s reduction method

Abstract

A Rapid method for solving the Integer linear programming problem, refraining from the usage of Gomorian constraint and dual simplex method is evolved by utilizing the CMI Reduction Method. The CMI Reduction Method relieves the user from the formation of Gomorian constraint from the final iteration followed by rest other procedures. To derive the solution with the given constraints CMI Reduction Method is applied in the final iteration which leads to the desired solution within the short span. Keeping the students in mind as they face and feel lot of complications in solving Integer linear programming problems the CMI Reduction method is incorporated. As the complexities are rooted out, this method will get due significance in solving the problems with multiple constraints. This will impart comfort to the students and help them to avoid mistakes by doing repeated iterations and cross mapping. This Proposed method is illustrated with numerical examples.