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!
Solve by Steps for Two-Phase Method
Max Z = 5x1 + 8x2
Subject to
3x1 + 2x2 ≥ 3
x1 + 4x2 ≥ 4
x1 + x2 ≤ 5
& x1 ≥ 0, x2 ≥ 0
Answer
Standard LPP
3x1 + 2x2 - s1+ a1 = 3
x1 + 4x2 - s2+ a2 = 4
x1 + x2 + s3 = 5
x1 , x2 , s1, s2, s3, a1, a2 ≥ 0
Auxiliary LPP
Max Z* = 0x1 + 0x2 + 0s1 + 0s2 + 0s3 -1a1 -1a2
As all Δj ≥ 0, Max Z* = 0 and no artificial vector appears in the basis, we move to phase II.
Phase II
As all Δj ≥ 0, optimal basic feasible solution is achieved. Thus the solution is Max Z = 40, x1 = 0, x2 = 5
How do I use C# to program an M/M/s queue model?
Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12
explain the different techniques as operation research
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 400 tons of grade X paper and 300 tons of grade Y paper in
the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0
krr emee ee
Demerits a.It cannot be used in the case of bi variate distribution. b.If the numbers of items are greater than say 30, the calculation becomes tedious and requ
#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
The following equation gives Jane's linear demand curve for visits to a nearby national park. Q is the number of visits per week and P represents the price of a pass (price per vi
what are the preconceptions do you bring to the study of research
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