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
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 in
In your role as a Consultant to a renowned organisation or institution, you have been asked to design and submit a research proposal to examine the future sustainability of its bus
discuss the seauencing decision problem for n jobs on two and three machines
main components of a linear programming
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
factors affecting tha transportation cost
User Groups: The next step would be to identify more specifically the potential user groups. This may be done on the basis of interviews, questionnaires, study of organisation
rectangular game
A company manufactures two types of printed circuits. The requirements of transistors, resistors and capacitor for each type of printed circuits along with other data are given in
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
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