Abstract
This chapter presents a relatively new area of mathematics called linear programming. The word programming is derived from the early applications of the subject to problems in the programming or allocation of supplies. The transportation problem is an important type of linear programming problem. In this kind of problem there are various warehouses and various stores and the cost of shipping an item from any warehouse to any store is known. A convex set means connecting any two points in the set by a line segment to put the line segment completely in the set. The convex sets are of two types: bounded and unbounded. A bounded set is one that can be enclosed by some suitably large circle, and an unbounded set is one that cannot be so enclosed. A corner point in a convex set is any point in the set that is the intersection of two boundary lines. An optimal solution is a feasible solution that makes the objective function as large or as small as possible.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
