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

Modi, there are 5 plants located in different cities and manufacturer a com...

there are 5 plants located in different cities and manufacturer a common produt A

North west corner rule, North West Corner Rule for Initial Solution: Now ...

North West Corner Rule for Initial Solution: Now by applying North West corner rule we can initial solution. According to this rule without regard to cost consideration the

Line balancing methods - heuristic approach, Line Balancing Methods - Heuri...

Line Balancing Methods - Heuristic Approach  Heuristic mean serving to find i.e. to find out discover things for oneself. Heuristic describes a particular approach to problem so

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

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

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Transportation and assignment problem, What are the computer applications o...

What are the computer applications of transportation and assignment problem

Linear programming problem, Solve the following Linear Programming Problem ...

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

Distribution methods, 1: explain vogel''s approximation method? 2: explain ...

1: explain vogel''s approximation method? 2: explain optimality test?

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