Operations Research LPP Problems Individual assignment 1

Start Date:28.06.2014;End date: on or before 12.07.2014

LPP Problems:

Rules to solve LPP problems:

Step 1. Mark the unknowns in the given linear programming by x and y.

Step 2. Formulate the objective function.

Step 3. Translate all the constraints in the form of equalities.

Step 4. Solve these equalities simultaneously.


Step 5. Find the values of x and y for which the objective function z = ax + by has maximum
or minimum value (as the case may be).

1. Question 2: A blacksmith makes sickle and plough. Each sickle can be sold for a profit of Rs.30 and
each chair for a profit of Rs.10. The blacksmith can afford to spend up to 40 hours per week working and
takes six hours to make a sickle and three hours to make a plough. Customer demand requires that he
makes at least three times as many plough as sickle. Sickle take up four times as much storage space
as plough and there is room for at most four sickle each week. Formulate this issue of goldsmith as a
linear programming problem.
Solution:

Let : xS = number of sickle made per week
xP = number of plough made per week


Constraints total work time 6Xs + 3Xp 40 customer demand Xp 3Xs storage
space (Xp4) + Xs 4, and Xs , Xp 0

Objective maximize 30Xs + 10Xp

The solution lies at the intersection of

Xp4 + Xs = 4 and 6Xs + 3Xp = 40

Solve for Xs and Xp

Xp4 + Xs = 4 ................(i)

and 6Xs + 3Xp = 40 ....................(ii)

From (i), Xs = 4 - Xp4, put in (ii)

6( 4 - Xp4) + 3Xp = 40
Operations Research LPP Problems Individual assignment 1
Start Date:28.06.2014;End date: on or before 12.07.2014

=> 24 - 3Xp2 + 3Xp = 40

=> 24 + 3Xp2 = 40

=> 3Xp2 = 40 - 24 = 16

or Xp = 323 = 10.667


Plug the value of Xp in equation (i)

10.6674 + Xs = 4

Xs = 4 - 10.6674 = 1.333

Solving these two equations simultaneously we get Xp = 10.667, Xs = 1.333.

And the profit = 30Xs + 10Xp = 30(1.333) + 10(10.667) = Rs.146.667




Rules to solve LPP in graphical method:

1. Draw the graph of the constraints.
Determine the region which satisfies all the constraints and non-negative
constraints (x > 0, y > 0). This region is called the feasible region.

2. Determine the co-ordinates of the corners of the feasible region.

3. Calculate the values of the objective function at each corner.

4. Select the corner point which gives the optimum (maximum or minimum) value of the
objective function. The co-ordinates of that point determine the optimal solution.




Problem 1:- Use graphical method to solve the following linear programming problem.

Maximize Z = 2x + 10 y; Subject to the constraints 2 x + 5y < 16, x < 5, and x > 0, y > 0.

Solution:
Operations Research LPP Problems Individual assignment 1
Start Date:28.06.2014;End date: on or before 12.07.2014





























Since x > 0 and y > 0 the solution set is restricted to the first quadrant.|

i) 2x + 5y < 16 Draw the graph of 2x + 5y = 16

2x + 5y = 16

y =

x 8 0 3
y 0 3.2 2


Determine the region represented by 2x + 5y < 16
ii) x < 5 Draw the graph of x = 5

Determine the region represented by x < 5.


Shade the intersection of the two regions. The shaded region OABC is the feasible
region B(5, 1.2) is the point of intersection of 2x + 5y = 16 and x = 5. The corner points of
OABC are O(0,0), A(5,0), B(5,1.2) and C(0,3.2).
Corners O(0,0) A(5,0) B(5,1.2) C(0,3.2)
Z = 2x + 10 y 0 10 22 32
Operations Research LPP Problems Individual assignment 1
Start Date:28.06.2014;End date: on or before 12.07.2014



Z is maximum at x = 0, y = 3.2

Maximum value of Z = 32.

2. Problem 2: Use graphical method to solve the following linear programming problem.
Maximize Z = 20 x + 15y

Subject to 180x + 120y <
1500, x + y < 10,

x > 0, y > 0

Solution:































Since x > 0 and y > 0, the solution set is restricted to the first quadrant.

i) 180x + 120 y < 1500


180x + 120y < 1500 => 3x + 2y < 25.
Draw the graph of 3x + 2y = 25

3x + 2y = 25
Operations Research LPP Problems Individual assignment 1
Start Date:28.06.2014;End date: on or before 12.07.2014

y =

x 0 5

y 0 5


Determine the region represented by 3x + 2y < 25.



ii) x + y < 10 Draw the graph of x + y = 10 x + y = 10
y =10 - x

x 0 10 5
y 10 0 5

Determine the region represented by x + y < 10


Shade the intersection of the two regions. The shaded region OABC is the feasible region.
B(5,5) is the point of intersection of 3x + 2y = 25 and x + y = 10. The corner points of OABC

are O(0,0), A( , 0), B (5,5) and C(0,10).



Corners O(0,0)
A( ,0)
B(5,5) C(0,10)



Z = 20x + 15 y 0 166.67 175 150


Z is maximum at x = 5 and y = 5. Maximum value of Z = 175.

Assignment:

1. A National News channel, as a part of its growth strategy, wishes to enhance its Television &
Radio base viewers. It was recommended by an expert panel to target the following two set
of viewers; a) Customers with annual income > 50,000 INR and b) Customers with annual
income of < 50,000 INR.
The budget allocation for the viewer base enhancement project is 300000 INR,

cost of an programme in Television would cost 45,000 INR & cost of radio programme would
is 15,000 INR. As a part of companys strategic policy the ratio of TV programmes to Radio
programmes is maintained as 3 : 5.

The panel had conducted a survey as well, which found that a TV programme would reach
approximately 7,50,000 viewers in category a & 1,50,000 in category b; similarly a radio
programme would reach 40000 viewers in category a & 260000 in category b.
Operations Research LPP Problems Individual assignment 1
Start Date:28.06.2014;End date: on or before 12.07.2014


Formulate the news channel case in linear programming & determine the media mix to
maximise the audience reach.



2. A famous Multinational Hand drill company has several models of hand drill guns being used
in the market, Cobra - mini hand drill guns were a great hit in the market in view of its
compactness and usage agility.
Off late Several customer complaints on cobra were registered.

A reputed large customer who had purchased 7500 mini hand drills gave a ultimatum to
resolve the customer complaint on SOS basis, being a large & important customer ,
management had to depute a team of service engineers to customers site to resolve the
issue.

There were two grades of service engineers a.service engineer & b. Sr. Service engineers
who are deputed to resolve this customer complaint. It is required atleast 900 hand drills are
serviced in 8 hour shift. Sr. Service engineer could service 25 hand drill guns per Hour with an
accuracy of 98% and service engineer can service at the rate of 15 hand drills per hour with a
accuracy of 95%.The wage for Sr.Engineer is 400 per Hour and the service engineer is Rs.300
per Hour. each time an error occurs, cost to the company is Rs.200, company has 8 Sr.
Service engineers & 10 service engineers. Company wants to quickly explore the options of
deputation of service engineers to minimise the service cost.

formulate using the LPP model and use graphical method to resolve the same.

3. A land lord has got 20 acres of land , which was not cultivated for long time.one fine day he
decided to cultivate the same, the land was fertile for both wheat and rice. He could not
decide how much area needs to be cultivated for wheat and how many for rice.

The cost per acre to grow rice is Rs.3000 and cost to grow wheat per acre is
Rs.2000. land lord could earmark Rs. 48,000.

Due to automation in farming rice requires 1 man-day per acre for ploughing and sowing and
wheat requires 2 man-days per acre .There are 36 man-days available.

Profit from rice per acre would be Rs.10,000 and that from wheat would be 12,000 per acre.

Formulate the land lords problem and decide the number of acres for each crop to maximise
the profit.

End of assignment