This of the network shown in the Figure below as a highway map, and the number next to each arc as the maximum elevation encountered in traversing the arc. A traveler plans to drive from node 1 to node 12 on this highway. This traveler dislikes high altitudes and so would like to find a path from node 1 to node 12 that minimizes the maximum altitude (so the max altitude of path 1-4-7-10-11-12 is 6). *Hint: Think Mini-max formulation from game theory. Formulate a mathematical model of this network model. (Modify mathematical formulation of network models)

I have a shortest path model but I don't know how to apply mini-max from game theory. I need some assistance with the basic set up

 

Transcribed Image Text:

4 1 4 7 10 1 1 4 2 2 8 11 9 2 6 9 12 1 3. 3. 3. 4 1 4 7 10 1 1 4 2 2 8 11 9 2 6 9 12 1 3. 3. 3.

Answer rating: 100% (QA)

Shortest Path root from Node 1 to Node 12 is There are sevaral paths exit fro... View the full answer