Management Science

Linear Programming: Mathematical Illustration

Practice Drill 01
A company manufactures two products X and which require, the
following resources. The resources are the capacities machine M1,
M2 and M3. The available capacities are 50, 25 and 15 hours
respectively in planning period.
Product X requires 1 hour of machine M2 and 1 hour of machine
M3. Product Y requires 2 hours of machine M1, 2 Hours of machine
M2 and 1 hour of machine M3. The profit contribution of products X
and Y are Taka 5 and 4 respectively.

© Muhaiminul Islam
Practice Drill 02
A tailor has the following materials available. 16 square meters of
cottons, 11 square meters of silk and 15 square meters of wool. He
can make out two products from these three materials, namely
dress and suite.
A dress requires the following: 2 square meters of cotton, 1 square
meter of silk and 1 square meter of wool. A suite requires 1 square
meter of cotton, 2 square meter of silk and 3 square meter of wool.
If the gross profit realized from a dress and a suite is respective
N30 and N50.
Formulate the above as a linear programming model and solve it.

© Muhaiminul Islam
Practice Drill 03
Following is given 5 constraints,
i.
ii.
iii.
iv.
v.
Minimization objective z =
Find out the feasible area and at what point you can ensure
minimization objective.

© Muhaiminul Islam
Practice Drill 04
Maximize Z = 1.5 +
Subject to

, ≥0
Solve the above linear programming model graphically.

© Muhaiminul Islam
Practice Drill 05

, ≥0
Solve the above linear programming model graphically
where the objective function is Minimize Z = 8 + 2

© Muhaiminul Islam
Practice Drill 06
A clothier makes coats and slacks. The two resources required are
wool cloth and labor. The clothier has 150 square yards of wool
and 200 hours of labor available. Each coats requires 3 square
yards of wool and 10 hours of labor, whereas each pair of slacks
requires 5 square yards of wool and 4 hours of labor.
The profit for a coat is $ 50 and the profit for slack is $ 40. The
clothier wants to determine the numbers of coats and pairs of
slacks to make so that profit will be maximized.
a) Formulate a linear programming model for this problem
b) Solve this by using graphical analysis

© Muhaiminul Islam
Practice Drill 07
The crumb and custard bakery makes coffee cakes and Danish
pastries in large pans. The main ingredients are flour and sugar.
There are 25 pounds of flour and 16 pounds of sugar available, and
the demand for coffee cake is 5. Five pounds of flour and 2 pounds
of sugar are required to make a pan of coffee cakes and 5 pounds
of flour and 4 pounds of sugar are required to make a pan of
Danish. A pan of coffee cakes has a profit of $ 1 and a pan of
Danish has a profit of $ 5. Determine the number of pans of cakes
and Danish to produce each day so that profit will be maximized.
a) Formulate a linear programming model for this problem
b) Solve this by using graphical analysis

© Muhaiminul Islam
Practice Drill 08
A jewelry store makes neckless and bracelets from gold and
platinum. The store has 18 ounces of gold and 20 ounces of
platinum. Each neckless requires 3 ounces of gold and 2 ounces of
platinum, whereas each bracelet requires 2 ounces gold and 4
ounces of platinum. The demand for bracelets is no more than
four. A necklace earns $ 300 in profit and a bracelet $ 400. The
store wants to determine the number of necklaces and bracelets to
make in order to maximize profit.
a) Formulate a linear programming model for this problem
b) Solve this by using graphical analysis

© Muhaiminul Islam
Practice Drill 09
A California grower has a 50 acre farm on which to plant
strawberries and tomatoes. The grower has available 300 hours of
labor per week and 800 tons of fertilizer and he has contracted for
shipping space for a maximum 26 acres’ worth of strawberries and
37 acres’ worth of tomatoes. An acre of strawberries requires 10
hours of labor and 8 tons fertilizer. The profit from an acre of
strawberries is $400 and the profit from an acre of tomatoes is $
300. The farmer wants to know the number of acres of
strawberries and tomatoes to plant to maximize profit.
a) Formulate a linear programming model for this problem
b) Solve this by using graphical analysis

© Muhaiminul Islam
Practice Drill 10
Moore’s Meatpacking company produces a hot dog mixture in 1,000 pound
batches. The mixture contains two ingredients- chicken and beefs. The cost per
pound of each of these ingredients is as follows:
Ingredient Cost/lb.
Chicken $3
Beef $5

Each batch has the following recipe requirements:

a) At least 500 pounds of chicken
b) At least 200 pounds of beef
The ratio of chicken to beef must be at least 2 to 1. The company wants to know
the optimal mixture of ingredients that will minimize cost. Formulate the linear
programming model for this model.

© Muhaiminul Islam
 The End

© Muhaiminul Islam