Continuing the previous problem, suppose again that all arcs go in both directions, but suppose Maude’s objective is to find the shortest path from node 1 to node 7 (not node 10). Modify the...

Continuing the previous problem, suppose again that all arcs go in both directions, but suppose Maude’s objective is to find the shortest path from node 1 to node 7 (not node 10). Modify the spreadsheet model appropriately and solve.

The required downtime in the crew-scheduling problem is currently assumed to be 1 hour. Suppose we instead require it to be 2 hours. How does the model need to be modified? What is the new optimal solution?