Solve by computational procedure of big – m method, Operation Research

Assignment Help:

Example 2

Max Z = 3x1 - x2

Subject to

            2x1 + x2 ≥ 2

            x1 + 3x2 ≤ 3

            x2 ≤ 4

    &     x1 ≥ 0, x≥ 0

 

Answer

SLPP

Max Z = 3x1 - x2 + 0s1 + 0s2 + 0s3 - M a1

    Subject to

                        2x1 + x2 - s1+ a1= 2

                        x1 + 3x2 + s2  = 3

                        x2 + s3 = 4

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

 

 

As all Δj ≥ 0, optimal basic feasible solution is achieved. Hence the solution is Max Z = 9, x1 = 3, x2 = 0

 

816_Big_M_Method.png


Related Discussions:- Solve by computational procedure of big – m method

Conclusions and recommendations , Conclusions and Recommendations  Con...

Conclusions and Recommendations  Conclusions  should  be drawn with  direct  reference to the objectives  of the study. The  readers should  be able  to read the objectives. T

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

Explain the history of boots and shoes, Question 1 Explain any five access...

Question 1 Explain any five accessory industries Question 2 Explain the history of boots and shoes Question 3 Write short notes on following- Types of Gujarati emb

Production option and the ato process design, The plant is using the chase ...

The plant is using the chase production option and the ATO process design. The BOM is illustrated below.   Requirement The factory works on a process layout but

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

Linear Programming Problem, A paper mill produces two grades of paper viz.,...

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

Liner proggraming , A paper mill products two grade of paper viz., X & Y. B...

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

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Plz get the ans , #questioA paper mill produces two grades of paper viz., X...

#questioA 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

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