Linear programming solution by steps for two-phase method, Operation Research

Assignment Help:

Solve by Steps for Two-Phase Method

Max Z = 5x1 + 8x2

Subject to

3x1 + 2x2 ≥ 3

x1 + 4x2 ≥ 4

x1 + x2 ≤ 5

    &     x1 ≥ 0, x≥ 0

Answer

Standard LPP

 

Max Z = 5x1 + 8x2  

    Subject to

                        3x1 + 2x2 - s1+ a1 = 3

                        x1 + 4x2 - s2+ a2  = 4

                        x1 + x2 + s3 = 5

                        x1 , x2 , s1, s2, s3, a1, a≥ 0

 

Auxiliary LPP

Max Z* = 0x1 + 0x2 + 0s1 + 0s2 + 0s3 -1a1 -1a2

    Subject to

                        3x1 + 2x2 - s1+ a1 = 3

                        x1 + 4x2 - s2+ a2  = 4

                        x1 + x2 + s3 = 5

                        x1 , x2 , s1, s2, s3, a1, a≥ 0

1377_two-steps-method-LPP.png

 

As all Δj ≥ 0, Max Z* = 0 and no artificial vector appears in the basis, we move to phase II. 

Phase II

266_phase-II.png

As all Δj ≥ 0, optimal basic feasible solution is achieved. Thus the solution is Max Z = 40, x1 = 0, x2 = 5


Related Discussions:- Linear programming solution by steps for two-phase method

SMU 2nd Semester, A paper mill produces two grades of paper viz., X and Y. ...

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

Network problem, Consider the following network where the value on each arc...

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

Evolution, how did operation research evolve

how did operation research evolve

Graphic , max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x...

max z 60x1+50x2 Sab to 4x1+10x2 2x1+2x2 3x1+2x2 X1+x2. >_ o

Higher order table, Higher Order  Table   When  three  or more  charac...

Higher Order  Table   When  three  or more  characteristics are represented in the same  table such a table  is called  higher order table. The  need  for such  a table arises

Linear programimg, 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

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

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

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

difference between simplex solution procedure for maximisation and minimisation

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