International Journal of Statistics and Applied Mathematics
  • Printed Journal
  • Indexed Journal
  • Refereed Journal
  • Peer Reviewed Journal

International Journal of Statistics and Applied Mathematics

2018, Vol. 3, Issue 1, Part A

An alternative of converting feasible solution into basic feasible solution of linear programming problem


Author(s): Ashu Vij

Abstract: The simplex algorithm is a procedure that iteratively selects extreme point solutions or basic feasible solutions, but it must start with an extreme point or a basic feasible solution. So if a feasible solution of a linear programming problem (which satisfies the given linear equations along with non-negative constraints) is given, it is more important to have a basic feasible solution. In this paper, an alternative way of converting a feasible solution into a basic feasible solution of linear programming problem is described.

Pages: 50-53 | Views: 924 | Downloads: 74

Download Full Article: Click Here
How to cite this article:
Ashu Vij. An alternative of converting feasible solution into basic feasible solution of linear programming problem. International Journal of Statistics and Applied Mathematics. 2018; 3(1): 50-53.
Call for book chapter
International Journal of Statistics and Applied Mathematics