Sample linear programming problems to calculate max profit, Operation Research

Assignment Help:

The following linear programming is written to plan the production of two products. And the company wants to maximize profits.

x1 = number of product 1 produced in each batch

x2 = number of product 2 produced in each batch

Max subject to"

150x1+250x2

2x1+ 5x2 <= 200

3x1 + 7x2 <= 175

X1, x2 >= 0

How much profit is earned per each unit of product 2 produced?

a.     150

b.     175

c.      200

d.     250

 Given that

  Max Z = 150 x1 + 250 x2

 Subject to

2x1 + 5x2 <= 200

3x1 + 7x2 <= 175

And x1, x2 >= 0                  

From constraints

  2x1 + 5x2 = 200..............................  (A)

3x1 + 7x2 = 175 ...................................(B)

Or

6x1 + 15x2 = 600

6x1 + 14x2 = 350

Subtracting

X2 = 250

 Put value of x2 in equation (A), we get

2x1 = 200 - 1250 = - 1050

ð X1 = -525 which is meaning less because x1 >= 0, x2>= 0

Thus x1 = 0 and x2 = 250 .

To maximize profit , company should produce 250 units of product 2.

(d) is right answer

10.   Given  that x1 unit of resources 1, and x2 unit of resources 2.

 According to the problem

4x1 + 3x2 <= 150

Thus (b) is right answer 


Related Discussions:- Sample linear programming problems to calculate max profit

Calculate, A paper mill produces two grades of paper viz X and Y. Because o...

A paper mill produces two grades of paper viz X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper in

Research process, What kind of research situation do the two new brand...

What kind of research situation do the two new brands present for Mr. Lynn company?

Convenience sampling - sampling decisions , Convenience  Sampling In...

Convenience  Sampling In  convenience  sampling  selection the researcher chooses the  sampling  units on the   basis of convince or  accessibility. It is  called  accidental

Sample linear programming problems to calculate max profit, The following l...

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Software, role of computer software operation research

role of computer software operation research

Area under standard normal curve, Area under Standard Normal Curve The...

Area under Standard Normal Curve The graph  of the  standard  normal  curve y = p(z) with  different percentages areas is  shown here. Since p(z) is  a probability  distributi

LPP, . A paper mill produces two grades of paper viz., X and Y. Because of ...

. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

LINEAR PROGRAMMING, b. A paper mill produces two grades of paper viz., X an...

b. A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y pape

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