Question: solve the following LPP by Simplex method Q: Maximize = + 2 Subject to the following constraints + 0 3 + 2 0 0, 0:
solve the following LPP by "Simplex method
Q: Maximize = + 2 Subject to the following constraints
+ 0
3 + 2 0
0, 0:
Q2 Find the initial feasible solution of the following transportation problem using .: 1. NWCM (North-West Corner method)
2. LCM (Least Cost method)
3. VAM (Vogel's approximation method) Supply Warehouses
| factory | W1 | W2 | W3 | W4 | SUPPLY |
| F1 | 14 | 25 | 45 | 5 | 6 |
| F2 | 65 | 25 | 35 | 55 | 8 |
| F3 | 35 | 3 | 65 | 15 | 16 |
| Demand | 4 | 7 | 6 | 13 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
