202x Filetype PDF File size 0.73 MB Source: d13mk4zmvuctmz.cloudfront.net
www.getmyuni.com CHAPTER-6: SIMPLEX & DUAL SIMPLEX METHOD 1. © Simplex method Introduction Simplex method = Simplex technique = Simplex algorithm. It is an iterative procedure for solving a linear programming problem in a finite no. of steps. This method provides an algorithm which consist in moving from one vertex of the region of feasible solution to another in such a way that the value of the objective function at the succeeding vertex is less (or more) than the preceding vertex so as to reach finally in the optimum solution. The following important definitions are necessary to understand the simplex method. (a) Basic solution Given a system 'm' simultaneous linear equations in 'n' unknowns (m