Modified Simplex Splitting Algorithm for Finding Feasible Solution of Systems of Linear Inequalities | Zendy

E. O. Effanga | Zendy; Z. Lipcsey | Zendy; M. E. Nja | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modified Simplex Splitting Algorithm for Finding Feasible Solution of Systems of Linear Inequalities

Author(s) -

E. O. Effanga,

Z. Lipcsey,

M. E. Nja

Publication year - 2012

Publication title -

journal of mathematics research

Language(s) - English

Resource type - Journals

eISSN - 1916-9809

pISSN - 1916-9795

DOI - 10.5539/jmr.v4n1p116

Subject(s) - mathematics , simplex algorithm , simplex , vertex (graph theory) , algorithm , mathematical optimization , linear programming , work (physics) , graph , combinatorics , mechanical engineering , engineering

In this paper the existing simplex splitting algorithm for finding a feasible solution of systems of linear inequalities is modified by evolving a vertex-determination technique. The existing algorithm cannot determine when the system of linear inequalities is infeasible hence the need for a modification. The modified algorithm is able to determine the feasible solution whenever it exists and to detect infeasibility whenever it occurs. The modified algorithm is tested on a problem that has a feasible solution and also on a problem that has no feasible solution and is found to work perfectly well

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research