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
Question 1 Explain Pre-Store opening activities and State at least 10 pre-store opening activities that should be ideally carried out in a retail store? Question 2 What ar
Project Management Your data need to be organized in such a way that access to them is both quick and accurate. In achieving this a good qualitative analysis progra
#queStudy the case and provide an alternative compensation design, which would redress the problem faced by the two- wheeler major in Chennai.stion..
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
These models have been developed to establish a trade off between costs of providing and the waiting time of a customer in the queuing system. Constructing a model entails desc
what are the models of operational research?
Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv
how did operation research evolve
RANK SUM TEST THE MANN WHITNEY U - TEST Mann Whitney u test is an alternative to the samples test. This test is based on the ranks of the observation of two samples pu
I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.
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