Scribd
Upload
35 views3 pages

Tutorial 1

Uploaded by

Vaibhav Ojha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views3 pages

Tutorial 1

Uploaded by

Vaibhav Ojha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Indian Institute of Technology Indore

Department of Mathematics
Linear Programming (MA 217)
Course Instructor: Dr. M. Tanveer
Tutorial-1

1. A company manufactures two products A and B. These products are processed in the same
machine. It takes 10 minutes to process one unit of product A and 2 minutes for each unit
of product B and the machine operates for a maximum of 35 hours in a week. Product A
requires 1 kg and B requires 0.5 kg of raw material per unit, the supply of which is 600 kg
per week. Market constraint on product B is known to be minimum of 800 units every week.
Product A costs | 5 per unit and sold at | 10. Product B costs | 6 per unit and can be sold
in the market at a unit price of | 8. Determine the number of units of A and B per week to
maximize the profit.

2. A farmer has a 100 acre farm. He can sell all tomatoes, lettuce or radishes and can get a
price of | 1.00 per kg for tomatoes, | 0.75 a heap for lettuce and | 2.00 per kg for radishes.
The average yield per acre is 2,000 kg of tomatoes, 3,000 heaps of lettuce, and 1,000 kg of
radishes. Fertilizers are available at | 0.50 per kg and the amount required per acre is 100 kg
each for tomatoes and lettuce and 50 kg for radishes. Labour required for sowing, cultivating
and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce.
A total of 400 man-days of labour are available at | 20 per man-day. Formulate this problem
as a linear programming model to maximize the farmer’s total profit.

3. An electric appliance company produces two products: refrigerators and ranges. Production
takes place in two separate departments I and II. Refrigerators are produced in department
I and ranges in department II. The company’s two products are sold on a weekly basis. The
weekly production cannot exceed 25 refrigerators and 35 ranges. The company regularly
employs a total of 60 workers in the two departments. A refrigerator requires 2 man-weeks
labour while a range requires 1 man-week labour. A refrigerator contributes a profit of | 60

1
and a range contributes a profit of | 40. How many units of refrigerators and ranges should
the company produce to realize the maximum profit? Formulate the above as an LPP.

4. A firm manufacturers 3 products A, B, and C. The profits are | 3, | 2 and | 4 respectively.


The firm has 2 machines and given below is the required processing time in minutes for each
machine on each product

Machines Product-wise processing time (min)


A B C
M1 4 3 5
M2 3 2 4

Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must
manufacture 100 units of A’s, 200 units of B’s, and 50 units of C’s but not more than 150
units of A’s. Set up an LPP to maximize the profit.

5. A paper mill produces two grades of paper namely X and Y. Owing to raw material restric-
tions, it cannot produce more than 400 tons of grade X and 300 tons of grade Y in a week.
There are 160 production hours in a week. It requires 0.2 and 0.4 hours to produce a ton
of products X and Y, respectively with corresponding profits of | 200 and | 500 per ton.
Formulate the above as an LPP to maximize profit and find the optimum product mix.

6. Express the following LPP problem in standard form by using slack or surplus variables:

(a)

Max Z = 7x1 + 5x2

Subject to, 2x1 + 3x2 ≤ 20

3x1 + x2 ≥ 10

x1 , x2 ≥ 0

2
(b)

Max Z = 3x1 + 2x2 + 5x3

Subject to, 2x1 − 3x2 ≤ 3

x1 + 2x2 + 3x3 ≥ 5

3x1 + 2x3 ≤ 2

x1 , x2 , x3 ≥ 0

7. Express the following LPP problem in standard form:

Max Z = 3x1 + 5x2 − 2x3

Subject to, x1 + 2x2 − x3 ≥ −4

− 5x1 + 6x2 + 7x3 ≥ 5

2x1 + x2 + 3x3 = 10

x1 , x2 ≥ 0, x3 unrestricted in sign

8. Reformulate the problem into the standard form:

Min Z = 2x1 + 3x2

Subject to, 2x1 − 3x2 − x3 = −4

3x1 + 4x2 − x4 = −6

2x1 + 5x2 + x5 = 10

4x1 − 3x2 + x6 = 18

x3 , x4 , x5 , x6 ≥ 0

You might also like