A truck is making a delivery between New York and Los Angeles. The figure illustrates the main possible routes. At each edge of the graph, we have assigned a number to the number of litres of fuel the truck consumes to make that journey. Write the appropriate optimization program and find the most economical route. New York -> Cleveland 400 New York -> St Louis 950 New York -> Nashville 800 Cleveland -> Phoenix 1800 Cleveland -> Dallas 900 St Louis -> Phoenix 1100 St Louis -> Dallas 600 Nashville -> Dallas 600 Nashville -> Salt Lake City 1200 Phoenix -> Los Angeles 400 Dallas -> Phoenix 900 Dallas -> Los Angeles 1300 Dallas -> Salt Lake City 1000 Salt Lake City -> Los Angeles 600
How to solve this in lingo?
