Word problems based on formulation of linear programming, Operation Research

Assignment Help:

Word problems based on formulation of linear programming problems.

2.   A manufacturer produces nuts and bolts for industrial machinery. It takes 1 hour of work on machine 1 and 3 hours of work on machine 2 to produce a package of nuts. It takes 3 hours on machine 1 and 1 hour on machine 2 to produce a package of bolts. He earns a profit of Rs. 2.50 per package on nuts and Rs. 1 per package on bolts. Form a LPP to maximize his profit, if he operates each machine for almost 12 hours.

script

solution

Let x packages of nuts and y packages of bolts be produced. The objective of the manufacturer to maximize the profit is

Total Time required on machine 1 to produce x packages of nuts and y packages of bolts is equal to

 

Total Time required on the machine 2 to produce x packages of nuts and y packages of bolts is equal to

 s

According to restrictions,

For machine 1

For machine 2

 

Maximize z is equal to

 

Subject to constraints

 

 

To solve this graphically, let us take

The lines are drawn using suitable points on the graph.

The lines intersect at P(3,3)

Now shade the region of intersection of the lines.

The feasible region is OAPB

For the corner point O(0,0), z=

For the corner point A(4,0)

For the corner point P(3,3,)

For the corner point B(0,4)

Clearly z is maximum at x=3 , y=3 and the maximum value is 10.50

 

 

 

 

2.50x + 1y

 

 

1x + 3y

 

 

3x + 1y

 

 

 

 

 

X + 3y ≤ 12

3x + y ≤ 12 and x,y≥0

 

2.50x + y

 

X + 3y ≤ 12

3x + y ≤ 12

X ≥ 0, y ≥ 0

X + 3y =12

3x + y = 12, x=0, y=0

 

 

 

 

 

O(0,0),A(4,0),P(3,3,),B(0,4)

2.5(0) +1(0)=0

2.5(4)+1(0)=10

2.5(3)+1(3)=10.5

2.5(0)+1(4)=4

3.   A shopkeeper deals in 2 items → wall hangings and artificial plants. He had a space to store 80 pieces and Rs. 15000 to invest. A wall hangings cost him Rs. 300 and artificial plant Rs. 150. He can sell a wall hanging at a profit of Rs. 50 and artificial plant at a profit of Rs. 18. Assuming that he can sell all the items that he buys, formulate a LPP in order to maximize his profit.\

script

solution

Let x be the number of wall hangings and y be the number of artificial plants.

Profit of dealer is equal to

Objective function z is equal to

Since dealer invest atmost Rs. 15000

Therefore

Or

Also a dealer has space to store atmost 80 pieces.

Therefore,

 

Maximize z is equal to

Subject to constraints

 

 

 

To solve this graphically, we need to draw the graph

Let us the draw the lines 2x + y ≤100

X + y ≤ 80

X ≥ 0, y ≥ 0

On the graph by using suitable points.

The points of intersection are

Then shade the region of intersection of these two lines

The feasible points are OABC

Now to obtain the maximum value;

For The corner point O(0,0), z=

For the corner point A(50,0)

For the corner point B(20,60)

For the corner point C(0,100)

Clearly we get the maximum value of 2500 at A.(50,0)

 

 

 

50x + 18y

50x + 18y

 

 

300x + 150y ≤ 15000

2x + y ≤ 100

 

 

X + y ≤ 80

X ≥ 0, y ≥ 0

Z = 50x + 18y

2x + y ≤100

X + y ≤ 80

X ≥ 0, y ≥ 0

 

 

 

 

 

 

 

 

 

(20,60)

 

 

O(0,0),A(50,0),B(20,60),(C(0,100)

 

 

 

50(0)+18(0)=0

 

50(50)+18(0)=2500

50(20)+18(60)=2080

50(0)+18(100)=1800


Related Discussions:- Word problems based on formulation of linear programming

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Lpp linear programming problems exercise, Exercise Define the t...

Exercise Define the terms used in LPP. Mention the advantages of LPP. What are the assumptions and limitations of LPP? A firm produces three pro

Find out where you should now invest your money, Question : Suppose tha...

Question : Suppose that you want to invest $10000 in the stock market by buying shares in one of two companies: A and B. Shares in Company A are risky but could yield a 50% ret

Calculation of ranks correlation , Calculation of Ranks Correlation W...

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Operation research, types of OR ,technique and mathematical system and line...

types of OR ,technique and mathematical system and linear programming system in operation research

Stepping stone method, This is a  procedure of determining  the potential i...

This is a  procedure of determining  the potential if any for improving each  of the non basic variables in terms of the objective function. To determine  this  potential  each of

Types of correlation - correlation & regression analysis, Types of Correlat...

Types of Correlation 1. Positive Correlation : When the values  of two variables move  in the  same direction .e.  when an increase in  the values  of one  variables  is ass

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd