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!
Example 2
Max Z = 3x1 - x2
Subject to
2x1 + x2 ≥ 2
x1 + 3x2 ≤ 3
x2 ≤ 4
& x1 ≥ 0, x2 ≥ 0
Answer
SLPP
Max Z = 3x1 - x2 + 0s1 + 0s2 + 0s3 - M a1
2x1 + x2 - s1+ a1= 2
x1 + 3x2 + s2 = 3
x2 + s3 = 4
x1 , x2 , s1, s2, s3, a1 ≥ 0
As all Δj ≥ 0, optimal basic feasible solution is achieved. Hence the solution is Max Z = 9, x1 = 3, x2 = 0
Problems based on solution of a given LPP when it has multiple optimal solution: 1. Find the maximum and minimum values of 5x+2y, subject to the constraints -2x-3y ≤ -6
#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction
What are the basic 5 elements of modeling process
how to solve simplex method in LPP?
CRITICAL EXAMINATION OF THE APPLICATION OF DECISION THEORY TECHNIQUES OR MODEL IN BUSINESS DECISION MAKING IN NIGERIA
Explain the classification of models 1. Classification by function or uses 2. Classification by degree of qualification 3. Classification by physical characteristics 4. Classidicat
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
Q2. Six 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 assign
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
rectangular game
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