12.(i)Find the basic feasible solution of the following transportation problemby north-west corner rule. Also, find the optimal transportation plan.Available8060AB145323234 5To1. 2 63. 4 5C563D2445Required 60 60 30 4023104020200t

12345AvailabilityA4312680B5234560C3563240D2445320Requirement6060304010200

Answered: Find the basic feasible solution of the…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Which one is the optimal solution of given linear programming model? Max Z = X1 + X2 s.t. 8X1 + 6X2 12 X2 2 1 2X2 < 6 X1, X2 0. OA. X1= 9/4, X2 = 1, Max Z-13/4 O B. X1=3/ 2, X2 =1, Max Z-5/2 OC X1=6/8, X2 =3, Max Z-15/4 OD. X1=0, X2 = 3, Max Z=3 Seçimi Sıfırla
also if you could find the answer to what is the minimum cost, that is part 2 of this question Please answer all questions step by step
Suppose the following graphical representation of feasible solutions and direction of increasing of criterion fuction? Which point is optimal solution?
Needed to be solved correctly in 1 hour and get the thumbs up please show neat and clean work for it by hand solution needed Kindly solve ? percent correct by Hand please
determine an initial basic feasible solution to the following transportation problem using North-west corner method.
please send handwritten solution for Q3 part 1
Q2. Pharmaceutical company producing a single product sold it through five agencies situated in different cities. All of sudden there rouse a demand for the product in another five cities that didn't agency of the company. The company is now facing the problem of deciding on how to assign the existing agencies in order to dispatch the product to needy cities in such a way that the travelling distance is minimized. The distance between the surplus and deficit cities in kilometer is given the following table. Surplus city Deficit cities Deficit cites a b d. e A1 160 130 115 190 200 B1 135 120 130 160 175 C1 140 110 125 170 185 D1 50 50 80 80 110 E1 55 35 80 80 105 Determine the optimum assignment schedule.
Given is a LP model. Max Z = 4 x + 5 y s.t. x + 3 y ≤ 22 − x + y ≤ 4 y ≤ 6 2 x − 5 y ≤ 0 x ≥ 0, y ≥ 0 Plot all constraint equations on the same graph. Shade the Feasible region. Label the corner points of the Feasible region. Solve for decision variables x and y. Solve for Z.

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS

Find the basic feasible solution of the following transportation problem by north-west corner rule. Also, find the optimal transportation plan. 1 4 5 3 D 2, 4 4 Required 60 60 30 40 2 3 4 5 Available 1. 2 6 80 3. 4 5 60 6 3 2 40 5 3 20 10 A B 3 2 5 200 1 {