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

Determination of objectives and values, In the judgement phase due care ...

In the judgement phase due care must be given to define correctly the frame of references of the operation. Objectives and values, whether economic social or aesthetic shoul

Question, Solve the following Linear Programming Problem using Simple metho...

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

Linear programming, Solve the following Linear Programming Problem using Si...

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

Linear programing, Solve the following Linear Programming Problem using Sim...

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

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Meaning of a research report, Problem The important task ahead of the r...

Problem The important task ahead of the researcher is to document the entire work done in the form of a well-structured research report. Describe in brief the components of a R

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

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