Scribd
Upload
49 views

Chapter 4-OR

Uploaded by

Kshitij Negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
49 views

Chapter 4-OR

Uploaded by

Kshitij Negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

With C Programs

THIRD
EDITION S Kalavathy © Vikas Publishing House Pvt Ltd
CHAPTER 4
SIMPLEX METHOD
CHAPTER
CHAPTER
1 4

Simplex method is an iterative procedure for solving LPP in a finite


number of steps.

It provides an algorithm, which consists of moving from one vertex


of the region of feasible solution to another in such a manner that
the value of the objective function at the succeeding vertex is less
or more, as the case may be, than at the previous vertex.

This procedure is repeated and since the number of vertices is


finite, the method leads to an optimal vertex in a finite number of
steps or indicates the existence of unbounded solution.
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4

For the solution of any LPP by


simplex algorithm, the existence of
an initial basic feasible solution is
always assumed.
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4
CHAPTER
CHAPTER
1 4

You might also like