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
Family Application specialises in selling major appliances for use in kitchen remodelling. One of its more popular items is the SubZero refrigerator. Over the past 40 weeks, the
A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we
RANGE Range is the difference between the highest and the lowest value is series. This is the simplest absolute measure of dispersion. Symbolically : R= L- S
Six 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 assignment
Cost The cost factor is a very important factor in determining the size of the sample. The budget for research should be properly decided. The management may not lik
3. 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
Problem based on graphical solution of a given LPP when feasible region is bounded. 1. Solve the following linear programming graphically; Maximize and minimize z = 60x+
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
max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o
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