1. Set up the linear programming problem (both objective and constraints) for the following Network representation of the shortest route from node 1 to node 7.
![2315_Figure.png](https://secure.tutorsglobe.com/CMSImages/2315_Figure.png)
2. Set up the linear programming problem for the following network representation of the maximum flow entering node 1 and leaving node 6.
![717_Figure1.png](https://secure.tutorsglobe.com/CMSImages/717_Figure1.png)
3. Set up the linear programming problem for the following network representation of the following network representation of the production and inventory application over 3 periods.
![559_Figure2.png](https://secure.tutorsglobe.com/CMSImages/559_Figure2.png)