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

Linear programming problem, A paper mill produces two grades of paper viz.,...

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 i

Linear programming, A paper mill produces two grades of paper viz., X and Y...

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 i

OR, Models in OR

Models in OR

Operation Research, A paper mill produces two grades of paper viz., X and Y...

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 i

compute probabilities-transitions and transition rate, Consider a queueing...

Consider a queueing system with 1 counter, to which groups of customers arrive according to a Poisson proces with intensity l. The size of a group is 1 with probability p and 2 wit

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

difference between simplex solution procedure for maximisation and minimisation

BIG M, Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Minimize: 60P + 120Q Subject to: 2P + 3Q >10 P + 4Q >12 P, Q> 0

Least cost methods, The NW  corner  rule  described  earlier considers only...

The NW  corner  rule  described  earlier considers only  the availability  and supply  requirements  in making  assignments. It takes  no account  of the shipping  costs  given  in

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