A brief review of the Cuts in Integer Programming Problem
College of Business Administration, Al Kharj Prince Sattam bin Abdulaziz University, P.O. Box No.: 165, Zip Code:11942, Al Kharj, Kingdom of Saudi Arabia;
Email of Corresponding Author:- t.alam@psau.edu.sa,
The paper presents an overview of various cuts which are used in obtaining the integer solution to an Integer Programming Problem. The decision variables of any problem that must assume non-fractional values may be categorized as an integer programming.
The Cut is a device for reducing the feasible region. Whereas the feasible region is a set of feasible solution. Numerous mathematicians and researchers developed various Cuts for different Integer programming problem from time to time. An optimal solution is achieved in a minimum number of phases after using a developed Cut. Integer programming problems are widely used in many applications like Production planning, Scheduling, Telecommunications networks, Cellular network, etc.
Copy the following to cite this article:
TEG ALAM, "A brief review of the Cuts in Integer Programming Problem", Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 6, Page Number 149-154, 2016Copy the following to cite this URL:
TEG ALAM, "A brief review of the Cuts in Integer Programming Problem", Journal of Ultra Scientist of Physical Sciences, Volume 28, Issue 6, Page Number 149-154, 2016Available from: http://www.ultraphysicalsciences.org/paper/709/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
