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

Merits - correlation regression analysis , Merits a.It is simple  to ...

Merits a.It is simple  to understand  and easy  to calculate. b.It is very  useful  in the  case of data which  are of  qualitative nature  like  intelligence  honesty  be

Sequencing problem, how do you use gantt chart for solving sequencing probl...

how do you use gantt chart for solving sequencing problem ? why is it not employed for solving larger problems?

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Scope, Scope of operation research?

Scope of operation research?

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

#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

Linear programming, 3. A paper mill produces two grades of paper viz., X an...

3. 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