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

process technolgy, 1 strategic implication of product and process decision...

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

Big M mehod, source code in c available?

source code in c available?

Probability and non probability sampling , Probability and Non  Probability...

Probability and Non  Probability Sampling The following s are some  of the  considerations for the  selection  of probability  an non  probability  sampling. 1.Sometimes p

Linear programing, Solve the following Linear Programming Problem using Sim...

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

Precentile - measure of central tendency , Normal 0 false fal...

Normal 0 false false false EN-IN X-NONE X-NONE

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 subject to the constraints x1+x2=4 x1-x2=2 x1.x2=0

Methods of calculation of standard deviation , Methods  of calculation of ...

Methods  of calculation of standard deviation a. Calculation of Standard  Deviation  - Individual Series: There  are two methods of calculating standard  deviation in an ind

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.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.

Graphical method- minimization example, Minimization Example  A ...

Minimization Example  A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.

Linear problem, #q A paper mill produces two grades of paper viz., X and Y....

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

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