Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Solve by Steps for Two-Phase Method
Max Z = 5x1 + 8x2
Subject to
3x1 + 2x2 ≥ 3
x1 + 4x2 ≥ 4
x1 + x2 ≤ 5
& x1 ≥ 0, x2 ≥ 0
Answer
Standard LPP
3x1 + 2x2 - s1+ a1 = 3
x1 + 4x2 - s2+ a2 = 4
x1 + x2 + s3 = 5
x1 , x2 , s1, s2, s3, a1, a2 ≥ 0
Auxiliary LPP
Max Z* = 0x1 + 0x2 + 0s1 + 0s2 + 0s3 -1a1 -1a2
As all Δj ≥ 0, Max Z* = 0 and no artificial vector appears in the basis, we move to phase II.
Phase II
As all Δj ≥ 0, optimal basic feasible solution is achieved. Thus the solution is Max Z = 40, x1 = 0, x2 = 5
What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems
Simple Random Sampling This is simplest and most popular technique of sampling. In it each unit of the population has equal chance of being included in the samp
meaning of critical activity ..
Some areas of applications are Purchasing, Procurement and Exploration Quantities and timing of purchase Replacement policies Rules for buying, supplies Finance, Budgeting and Inv
Among other limitations of O. R the followings deserve mention: a. Basis: The operational researchers must be unbiased. An attempt to shoehorn result sin to a confirmation of ma
This method is more systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row or column with
How to derive solution for non degenracy
Describe Operation Research and discuss its applications in various organizations. A company assembles heavy duty refrigerators and uses two types of compressors A & B. Two comp
Biographies, Handbooks and Dictionaries: Dictionaries: Dictionaries primarily deal with all aspects of words from proper definitions to spellings. Webster's Third Ne
Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd