A Feasible Region Contraction Algorithm (Frca) for Solving Linear Programming Problems

E. O. Effanga, I. O. Isaac


This paper presents an alternative technique for solving linear
programming problems. It is centered on finding a feasible interior point each time the feasible region is contracted, thus generating a sequence of feasible interior points that converge at the optimal solution of linear programming problem. The convergence of the algorithm is proved, and it is shown that the algorithm performs faster in a smaller feasible region.

Full Text:


DOI: https://doi.org/10.5539/jmr.v3n3p159

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.