Answer to Question #309668 in Math for Ethan molla

Question

Q4. Convert the following linear programming problem into dual problem. Maximise Z = 22x1 + 25x2 +19x3 Subject to: 18x1 + 26x2 + 22x3 ≤ 350 14x1 + 18x2 + 20x3 ≥180 17x1 + 19x2 + 18x3 = 205 x1, x2, x3 ≥ 0 Q5. A work shop contains four persons available for work on the four jobs. Only one person can work on any one job. The following table shows the cost of assigning each person to each job. The objective is to assign person to jobs such that the total assignment cost is a minimum. Jobs 1 2 3 4 A 20 25 22 28 Persons B 15 18 23 17 C 19 17 21 24 D 25 23 24 24