Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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
solution
1. Let z = 3x + 5y
2. Let us Draw the line x + y = 6 and x + 3y = 3 using suitable points on the graph.
3.These lines intersect at
4. Now shade the region of intersection of these lines
5.Vertices of shaded feasible region are
Now,
At C(3,0)
At P(3\2,1\2)
At B(0,2)
Therefore at P(3\2,1\2), z=3x+5y is minimum
P(3\2,1\2)
(3,0) P(3\2,1\2) and B(0,2)
Z= 3x + 5y
Z= 9
Z= 7
Z= 10
SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0
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
give the procedure of tracing a closed loop
What is the optimum solution
impact of sequencing problem
Calculation of Ranks Correlation Where Ranks are Given: When the actual ranks are given the steps followed are: a.Compute the difference of the two ranks (R1 and
cumulative discount factor
scope of operation research in insutry and defence
Scope of operation research?
undertake the proposed research investigation in accordance with the agreed specification and procedures
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd