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
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
there are 5 plants located in different cities and manufacturer a common produt A
#questionA 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 grad
Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subject to 3_(x_1 )+?1.5?_(x_2 )=30 x_1+x_2=20 x_1=0 x_2=0
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
#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction
Rehearse Making presentation is not simple. It is extremely important for us to realize the sanctity of rehearsing to improve the quality of the presentation. Unless
solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints
A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an
Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1
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