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

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...

Full description

Bibliographic Details
Main Authors: Santosh Kumar, Elias Munapo, Maseka Lesaoana, Philimon Nyamugure, Nidhi Agarwal
Format: Article
Language:English
Published: International Journal of Mathematical, Engineering and Management Sciences 2017-12-01
Series:International Journal of Mathematical, Engineering and Management Sciences
Subjects:
Linear programming model
Simplex method
Feasible space reduction
Reduced number of variables.
Online Access:https://www.ijmems.in/assets//17-ijmems-si-vol.-2%2c-no.-4%2c-213%E2%80%93230%2c-2017.pdf

Internet

https://www.ijmems.in/assets//17-ijmems-si-vol.-2%2c-no.-4%2c-213%E2%80%93230%2c-2017.pdf

Similar Items