Problems based on lpp when feasible region is a line segment, Operation Research

Assignment Help:

Problems based on LPP when feasible region is a line segment or it does not exist.

1.    Maximize z = 2x+3y subject to the constraints

X + y ≤ 1

X + y ≥ 3

X,  y ≥ 0

script

solution

1.   Let z = 2x+3y

2.   Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.

3.   There is no common region satisfying the given conditions

X +y = 1 and x + y = 3


Related Discussions:- Problems based on lpp when feasible region is a line segment

Mip, procedure of mip

procedure of mip

Closed lood, give the procedure of tracing a closed loop

give the procedure of tracing a closed loop

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

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

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Inventory control of any company, give real data & find out the inventory &...

give real data & find out the inventory & give suggestions

What do you understand by customs duty, Question 1 What do you understa...

Question 1 What do you understand by customs duty? Explain the taxable events for imported, warehoused and exported goods. List down the types of duties in customs. An importer

Linear programming problem, Solve the following Linear Programming Problem ...

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

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