Open AccessA Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model
Author(s) -
Santosh Kumar,
Elias Munapo,
Maseka Lesaoana,
Philimon Nyamugure,
Nidhi Agarwal
Publication year - 2017
Publication title -
international journal of mathematical, engineering and management sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.228
H-Index - 10
ISSN - 2455-7749
DOI - 10.33889/ijmems.2017.2.4-017
Subject(s) - mathematical optimization , simplex algorithm , reduction (mathematics) , simplex , linear programming , mathematics , space (punctuation) , feasible region , regular polygon , process (computing) , computer science , combinatorics , geometry , operating system
This paper considers a conventional linear programming model of ‘n’ variables and ‘m’ constraints. In the proposed method, we deal with n_1 number of variables, where n_1≤n and use a strategic move to reduce the feasible convex search space before embarking on the simplex method. The feasible space reduction process can be repeated, if desired.