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

Model, disadvantages of model in operational research

disadvantages of model in operational research

Identify the various ways of selecting a random sample, Question 1 Discuss...

Question 1 Discuss the types of measurement scales used in research Question 2 Identify the various ways of selecting a random sample Question 3 Discuss five advan

Action Phase, What is The proper meaning of action phase will u help me to ...

What is The proper meaning of action phase will u help me to lern it in deeply????

A paper mill produces, . A paper mill produces two grades of paper viz., X ...

. 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

Optimal assigment, #quesSix Operators are to be assigned to five jobs with ...

#quesSix 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 assig

Solve the problem using simplex method, #question. A paper mill produces tw...

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

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Unit 8, undertake the proposed research investigation in accordance with th...

undertake the proposed research investigation in accordance with the agreed specification and procedures

Table of contents - report writing presentation, Table of contents ...

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n

Uses of standard deviation - measure of dispersion, Uses   of Standard D...

Uses   of Standard Deviation Normal 0 false false false EN-IN X-NONE X-NONE

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