c



 
 

› ? c
  Rahul Ads, an advertising company is planning a promotional
campaign for the client͛s product, i e sunglasses The client is willing to spend Rs 5
lakhs It was decided to limit the campaign media to a weekly magazine, a daily
newspaper and TV advertisement The product is targeted at middle-aged women, and
the following data was collected
Campaign media Cost per Expected viewers
advertisements(Rs

WeekelyMagzine 30000 ››5000

Daily Newspaper 45000 205000

TV advertisement ›25000 700000

The client is interested to spend only Rs › lakh on the ads in the weekly magazine which
expecting a viewership of a minimum of 2› lakh people in the case of the television
advertising Maximise the viewers to the advertisements
2 ?  
 Ñivakumar and Co manufactures two types of T-shirts, one with
collar and another without collar Each T-shirt with collar yields a profit of Rs 20, while
each T-shirt without collar yields Rs30 Ñhirt with collar requires ›5 minutes of cutting
and 25 minutes of stitching Ñhirt without collar requires ›0 minutes of cutting and 20
minutes of stitching The full shift time is available for cutting in an 8 hour shift, but only
6 hours are available for the stitching Formulate the problem as an LP model to
maximize profit
3 ? Chandru Bag company produces two types of school bags: deluxe and ordinary If the
company is producing only ordinary bags, it can make a total of 200 ordinary bags a day
Deluxe bag requires twice as much labour and time as an ordinary type The demand for
deluxe bag and ordinary bag are 75 and ›00 bags per day respy The deluxe bag yields a
profit of Rs ›2 0 per bag and ordinary bag yields a profit of Rs 7 00 per bag Formulate
the problem as an LP model
4 ? Ñ 
   : An investor is interested to invest in shares that has a
growth of at least Rs 500 initially with a dividend of at least Rs 400 per annum He
chose two shares ћ and Ñ2 A market study states that share ћ will earn a dividend of 7
percent per annum and share Ñ2 of ›5 percent per annum It is predicted that growth in
the market value in the first year share ћ will be 25 paise per rupee and in case of share
Ñ2, 35 paise per rupee invested Formulate the problem as an LP model
5 ? u
  : A doctor recommends a diet to a patient that will fulfill his daily
requirements of proteins, fats and corbohydrates at the minimum cost The choice is to
be made from four different types of foods The yields per unit of these foods are given
in table Formulate the problem as a linear programming model
Type of food Yield per unit Cost per unit
( Rs

Proteins Fats Carbohydrates

A 5 4 7 20

B 7 2 2 35

C 9 6 6 ›5

D 6 6 9 ›8

Minimum 900 ›00 500

requirement

6 ? J

  : An agricultural urea company must daily produce 500kg of a

mixture consisting of ingredients X›, X2, X3 Ingredient x›costs Rs 30 per kg X2Rs 50per
kg and X3Rs 20 per kg Due to raw material constraint, not more than ›00 kg of X›, 70 kg
of X2, and 45 kgof X3 must be used Determine how much of each ingredient should be
used if the company wants to minimize the cost
7 ? A company manufactures two products A and B These products are processed in the
same machine It takes ›0 minutes to process one unit of product A and 2 minutes for
each unit of product B The machine operates for maximum of 35 hours in a week
 Product A requires › kg and 0 5 kg of raw material per unit and the supply of which is
600kg per week Market constraint on product B is known to be 800 unit per week
Product A costs Rs 5per unit and sold at Rs ›0 Product B costs Rs 6 per week and can
be sold rs 8 Determine the number of units of A and B per week to maximize profit
8 ? An electronics company produces three types of parts for automatic washing machine
It purchases castings of the parts from a local foundry and then finishes the part on
drilling, shaping and polishing machines The selling prizes of part A, B and C respectively
cost Rs 8, Rs ›0, and Rs ›4 All parts made can be sold Castings for parts A, B and C
respectively cosgtRs 5, Rs 6 and Rs ›0
The shop possesses only one of each type of machine Costs per hour to run each of the
three machines are Rs 20 for drilling, Rs 30 for shaping and Rs 30 for polishing The
capabilities (parts per hour
for each part on each machines are shown in the following
table
Machine Capacity per hour

Part A PartB PartC

Drilling 25 40 25

Ñhaping 25 20 20

Polishing 40 30 40

The management of the shop wants to know how many parts of each type it should
produce per hour in order to maximize profit for an hour͛s run Formulate the problem
as an Lp model
9 ? A farmer has ›00 acres of farm He can sell all tomatoes, lettuce or radishes and can
raise the price to obtain Rs › per kg for tomatoes, Rs 0 75 per head of lettuce, and Rs
2 00 for radishes The average yield per acre is 2000kg of tomatoes, 3000heads of
lettuce and ›000kg of radishes Fertilisers are available at Rs 0 50 per kg , and amount
required per acre is ›00kgs each for tomatoes and lettuce and 50kgs for radishes
Labour required for sowing, cultivating, and harvesting per acre is 5 mad days for
tomatoes, and radishes and 6 mandays for lettuce A total of 400 man days off labour
are available at Rs 20 per manday Formulate an LPP to Maximise the farmers total
profit
›0 ?Ñolve the following using Graphical Method

a ? Max Z= 6X› +4 X2 b ? Max Z= 5X› +2 X2

Ñubject to constraints
Ñubject to constraints
2X› + 3X2 ч›20 2X› + 4X2 ч 60
2X› + X2 ч60
3X›ч ›50
X › , X2 ш 0
5X2 ч ›50
X › , X2 ш 0

c ? Min Z= ›8X› +›2 X2 d ? Min Z= 3X› +5 X2

Ñubject to constraints
Ñubject to constraints
2X› + 4X2 ч60
3X› + X2 ш 30 X› + X 2 ч 200
8X› + 4X2 ш ›200
3X›ч 80
X › , X2 ш 0
5X2 ш 60
X › , X2 ш 0

e ? Max Z= 7X› +5 X2 f ? Max Z= 2X› +5 X2

Ñubject to constraints
Ñubject to constraints
2X› + 3X2 ч8
-X› + X2 ч 2 X› + 2X2 ч 8
8X› + 4X2 ч 20
X› ч 4
X2 ч 3
 X › , X2 ш 0

g ? Min Z= ›8X› +›2 X2 h ? Max Z= 80X› +›20 X2

Ñubject to constraints
Ñubject to constraints
2X› + 4X2 ч 60
3X› + X2 ш 30 X› + X2 ч 9
8X› + 4X2 ш ›200
X› ш 2
X › , X2 ш 0
X2 ш 3
20X› + 50 X2ч 360
X › , X2 ш 0

i ? Max Z= 2X› + X2 j ? Min Z= -X› +2 X2

Ñubject to constraints
Ñubject to constraints
2X› + 8X2 ч 20
X› + X 2 ч 8 -X› + 3X2 ч ›0
X› - X 2 ч 2
X› + X 2 ч 6
X› - 2X2ч 2
X › , X2 ш 0 X› - X 2 ч 2
X › , X2 ш 0

k ? Min Z= 20X› +›0 X2 l ? Max Z= 3X› + X2

Ñubject to constraints
Ñubject to constraints
X› + 2X2 ч 40
3X› + X2 ш 30 X› + 2X2 ч 20
4X› + 3X2 ш 60
2X› + X2 ш ›0
X › , X2 ш 0
X› ч 5

X2 ч 7

X › , X2 ш 0

m ? Max Z= 3X› + 2X2 n ? Max Z= 40X› +60 X2

Ñubject to constraints
Ñubject to constraints
X› + X 2 ч 3
X› - X 2 ш 2 2X› + X2 ш 30
X› ч ›
X› + X 2 ч 40
X › , X2 ш 0
X› + 3X2 ш 90
X › , X2 ш 0
 o ? Max Z= 6X› + 4X2
Ñubject to constraints
2X› + 4X2 ч 4
4X› +8 X2 ш ›6
X › , X2 ш 0

›› ?Ñolve the following using Ñimplex Method

a ? Max Z= 30X› +40 X2 b ? Max Z= ›6X› +›7X2+›0 X3

Ñubject to constraints
Ñubject to constraints X› + X2+ 4X3ч2000
60X› + ›20X2ч›2000 2X›+X2 + X3ч3600
8X› + 5X2 ч600 X› + 2X2+2X3ч2400
3X› + 4X2 ч500 X›, X2, X3ш 0
X › , X2 ш 0

c ? Max Z= 4X› +3 X2 d ? Max Z= 3X› +5 X2+4 X3

Ñubject to constraints Ñubject to constraints
2X› + X2ч›000 2X› + 3X2 ч 8
X› + X2 ч800 2X2 + 5X3 ч ›0
X› ч400 3X› + 2X2+4X3 ч ›500
X2 ч700 X › , X2 ш 0
X › , X2 ш 0