4

The Transportation Problem

4.1 INTRODUCTION

In the previous chapter we have used simplex method to solve any type of linear programming problems. However, there is another method, Allocation method which is applied to a lot of very practical problems generally called Transportation problems. The objective of the problem is to transport a commodity (single product) from more than one centre, called origins (or sources, or supply or capacity centres) to more than one places called destinations (sinks or demand or requirement centres) and the costs of transportation from each of the origins to each of the destinations being different and known. It is further assumed that

  1. The availability as well as requirements of the various centers are finite ...

Get Operations Research, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.