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

Calculate the yearly cost of waiting time, The Omega company, Brisbane, pro...

The Omega company, Brisbane, produces potato chips, corn, cheese twists, and popcorn. These products are made in Brisbane and then shipped to company warehouses and distribution ce

Uncertainly, Uncertainly : There is a great uncertainly about economic a...

Uncertainly : There is a great uncertainly about economic and general environment. With economic growth uncertainty is also growing's. this makes each decisions costlier

Two sample tests- hypothesis testing, Two Sample Tests In some  situat...

Two Sample Tests In some  situation the researchers may be taking  statistical decisions based on two samples. Each  of the  two  samples may  represent a particular under con

Determine the optimal assignment., #questiSix Operators are to be assigned ...

#questiSix Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no ass

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

Application of operation reserch., how i make project report on "applicatio...

how i make project report on "application of or".i want help from you.can you give me idea to complete this report..

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

difference between simplex solution procedure for maximisation and minimisation

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

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, 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 Programming, A paper mill produces two grades of paper viz., X & Y. ...

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

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