12/15/2010
ACKNOWLEDGEMENT
First and foremost, we would like to thank to our mentor, Dr. G.N. Patel for his valuable guidance and advice throughout the project. Without his support and guidance, this report would not have been possible.
We would like to extend our sincere regards to the authorities of Birla Institute of Management Technology, Greater Noida (BIMTECH) for providing us with a good environment and facilities to complete this report. Also, we would like to take this opportunity to thank Centre for Business Management (CBM) of BIMTECH for offering this subject, Research Methodology and opportunity to do this project as a part of course curriculum.
Last but not the least we would like to thank our families and friends for their support in completing this project.
TABLE OF CONTENTS
1. Linear Programming ……........…………………………….................................4
2. Transportation Problem ……………………………............................................5
3. Case Study………………………………………..................................................8
4. Other Methods of solving transportation problem..................................................11
LINEAR PROGRAMMING
Linear programming is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.
More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Given a polytope and a real-valued affine function defined on this polytope, a linear programming method will find a point on the polytope where this function has the smallest (or largest) value if such point exists, by searching