Tutorial sheet-1
1. A person wishes to buy hens for his small farm house and there are
two types of hens that he can purchase. An old hen can be purchased
for Rs 200.00 while a young hen costs Rs 500.00. An old hen lays 5
eggs per week and a young hen lays 8 eggs per week, each egg worth
70 paise. Also, Rs 5 need to be spent on the diet of one hen per week.
A person has only Rs 5000.00 to spend for buying the hens. How
many hens of each kind he should buy to have a maximum profit per
week assuming that his farm house can not house more than 50 hens.
Formulate the problem as a linear programming problem.
2. A company has three operational departments (weaving, processing,
packing) with capacity to produce three different types of clothes,
namely, suiting, shirting and woolens. The profits are Rs 20, Rs 40, Rs
30, per meter respectively. One meter of suiting requires 3 minutes of
weaving, 2 minutes of processing and 1 minute of packing. One meter
of shirting requires 4 minutes of waving, 1 minutes of processing and
3 minute of packing, while one meter of woolen requires 3 minutes in
each department. Total run time of each department in a day is 8 hrs,
10 hrs, 7 hrs, respectively. Formulate the problem as a linear program
to maximize the profit.
3. An automobile manufacturer makes automobiles and trucks in a fac-
tory that is divided into two shops. Shop A, which performs the basic
assembly operation, must work 5 hrs on each truck and 2 hrs on each
automobile. Shop B, which performs finishing operations must work
for 3 hrs on each automobile or truck it produces. Because of man
and machine limitations, shop A has 180 hrs available while shop B
has 135 hrs. The manufacturer makes the profit of Rs 15000 on each
truck and Rs 10000 on each automobile. Construct the LPP which
maximizes the profit of manufacturer.
4. A company makes two products (X and Y) using two machines (A and
B). Each unit of X that is produced requires 50 minutes processing
time on machine A and 30 minutes processing time on machine B.
Each unit of Y that is produced requires 24 minutes processing time
on machine A and 33 minutes processing time on machine B.
At the start of the current week there are 30 units of X and 90 units
of Y in stock. Available processing time on machine A is forecast to
be 40 hours and on machine B is forecast to be 35 hours.
1
The demand for X in the current week is forecast to be 75 units and
for Y is forecast to be 95 units. Company policy is to maximise the
combined sum of the units of X and the units of Y in stock at the end
of the week.
• Formulate the problem of deciding how much of each product to
make in the current week as a linear program.
• Solve this linear program graphically.
5. A carpenter makes tables and chairs. Each table can be sold for a
profit of Rs.300 and each chair for a profit of Rs.100. The carpenter
can afford to spend up to 40 hours per week working and takes six
hours to make a table and three hours to make a chair. Customer
demand requires that he makes at least three times as many chairs as
tables. Tables take up four times as much storage space as chairs and
there is room for at most four tables each week.
Formulate this problem as a linear programming problem and solve it
graphically.
6. A company manufactures four products (1,2,3,4) on two machines (X
and Y). The time (in minutes) to process one unit of each product on
each machine is shown below:
X Y
1 10 27
2 12 19
3 13 33
4 8 23
The profit (in dollar) per unit for each product (1,2,3,4) is 10, 12, 17
and 8 respectively. Product 1 must be produced on both machines X
and Y but products 2, 3 and 4 can be produced on either machine. The
factory is very small and this means that floor space is very limited.
Only one week’s production is stored in 50 square meters of floor space
where the floor space taken up by each product is 0.1, 0.15, 0.5 and
0.05 (square meters) for products 1, 2, 3 and 4 respectively.
Customer requirements mean that the amount of product 3 produced
should be related to the amount of product 2 produced i.e. Over a
week at least twice as many units of product 2 should be produced as
product 3.
2
Machine X is out of action (for maintenance/because of breakdown)
5% of the time and machine Y 7% of the time. Assuming a working
week 35 hours long formulate the problem of how to manufacture these
products as a linear program maximizing profit.
7. A company is producing a product which requires, at the final assembly
stage, three parts. These three parts can be produced by two different
departments as detailed below.
Production rate (units/hr)
Part 1 Part 2 Part 3 Cost (£/hr)
Department 1 7 6 9 25.0
Department 2 6 11 5 12.5
One week, 1050 finished (assembled) products are needed (but up to
1200 can be produced if necessary). If department 1 has 100 working
hours available, but department 2 has 110 working hours available,
formulate the problem of minimising the cost of producing the fin-
ished (assembled) products needed this week as an LP, subject to the
constraint that limited storage space means that a total of only 200
unassembled parts (of all types) can be stored at the end of the week.
8. Let the function f (x1 , x2 ) = −3x1 +x2 be minimized over the solid tri-
angular region ABC with A : (−1, 0), B : (2, 0), C : (0, 1). Formulate
this as a LPP.
9. Reformulate the following problem as a LPP in standard form.
max min{3x − 10, −5x + 5}
subject to
0 ≤ x ≤ 5.
10. Reformulate the following problem as a LPP in standard form.
max min{x1 + 2x2 , x2 }
subject to
|2x1 + x2 | ≤ 7,
3x1 −x2
1+x1 +x2 ≤ 0.5,
x1 , x2 ≥ 0.
3
11. Reformulate the following problem as a LPP in standard form.
min |x1 | + 3|x2 |
subject to
−x1 + x2 ≥ 4,
x1 − x2 ≤ 3.
12. Reformulate the following problem as a LPP in standard form.
min |x1 | + 3|x2 |
subject to
x1 + 2x2 ≥ 10,
x1 − x2 = 5.
13. Reformulate the following problem as a LPP in standard form.
min max{x1 , x2 }
subject to
|x1 + 2x2 | ≤ 3,
x1 + 3x2 ≥ 6,
−2x1 + x2 ≥ 4,
x1 , x2 ≥ 0.