An Introduction To Linear Programming

By: Raybot Man Bania EMBA 1st Semester

 Linear programming is a mathematical method to achieve the best outcome in a given mathematical model. Standard Form Optimize: z= f(x1,x2,,xn) Subject to: g1(x1,x2,..,xn) ,=, b1 g 2(x1,x2,..,xn) ,=, b2 . gm(x1,x2,..,xn) ,=, bm

 Illustrative example 1: The village butcher shop traditionally makes its meat loaf from a combination of lean ground beef and ground pork. The ground beef contains 80 percent meat and 20 percent fat, and costs the shop 80 cents per pound; the ground pork contains 68 percent meat and 32 percent fat, and costs 60 cents per pound. How much of each kind of meat should the shop use in each pound of meat loaf if it wants to minimize its costs and to keep the fat content of the meat loaf to no more than 25 percent.

 The objective is to minimize the cost Let X1= poundage of ground beef used in each pound of meat loaf X2= poundage of ground pork used in each pound of meat loaf We express the objective as Minimize: z= 80x1+60x2(1)

Constraints: 0.20x1+0.32x20.25 .(2) X1+x2= 1 ..(3) x1 0 and x20..(4)

Combining these condition with (1),(2),(3) and (4), we obtain

 Minimize: Subject to:

z= 80x1+60x2 0.20x1+0.32x20.25 x1+x2= 1 x1 0 x20

 Illustrative example 2:
Find numbers x1 and x2 that maximize the sum x1 + x2 subject to the constraints x1 0, x2 0, and x1 + 2x2 4 4x1 + 2x2 12 x1 + x2 1

This was just a short introduction to LP and what it is used for. There are many more aspects and topics in LP which are not as easy as the problems I have shown .

THANK YOU!