IJMEMES logo

International Journal of Mathematical, Engineering and Management Sciences

ISSN: 2455-7749 . Open Access


A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model

A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model

Santosh Kumar
Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria, Australia.

Elias Munapo
School of Economics and Decision Sciences, North West University, Mafikeng Campus, Mafikeng, South Africa.

‘Maseka Lesaoana
Department of Statistics and Operations Research, School of Mathematical and Computer Sciences, University of Limpopo, Turf loop Campus Private Bag X1106, Sovenga 0727, South Africa.

Philimon Nyamugure
Department of Statistics and Operations Research, National University of Science and Technology, PO Box AC939, Ascot, Bulawayo, Zimbabwe.

Nidhi Agarwal
Government Girls Senior Secondary School, Kota, Rajasthan, India.

DOI https://dx.doi.org/10.33889/IJMEMS.2017.2.4-017

Received on November 27, 2016
  ;
Accepted on December 26, 2016

Abstract

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.

Keywords- Linear programming model, Simplex method, Feasible space reduction, Reduced number of variables.

Citation

Kumar, S., Munapo, E., Lesaoana, â., Nyamugure, P., & Agarwal, N. (2016). A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model. International Journal of Mathematical, Engineering and Management Sciences, 2(4), 213-230. https://dx.doi.org/10.33889/IJMEMS.2017.2.4-017.