A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model
Santosh Kumar, Elias Munapo, Maseka Lesaoana and 2 more
International Journal of Mathematical, Engineering and Management Sciences · 2017
doi:10.33889/ijmems.2017.2.4-017 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
References16
16 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.