{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

GreenJet

# GreenJet - In-Class(Flights Solution NW 1000 NC 2500 1 0 0...

This preview shows pages 1–2. Sign up to view the full content.

In-Class (Flights NW NC NA BW BC BA MW MC MA TOTAL MINIMIZE 1000 2500 2000 1750 3000 2500 3000 5000 1500 24500 subject to: From NY 1 1 1 0 0 0 0 0 0 8 <= 8 From Mia 0 0 0 0 0 0 1 1 1 7 <= 10 From Bos 0 0 0 1 1 1 0 0 0 1 <= 4 To Atl 0 0 1 0 0 1 0 0 1 7 >= 7 To Chi 0 1 0 0 1 0 0 1 0 3 >= 3 To Wash 1 0 0 1 0 0 1 0 0 6 >= 6 Solution: 6 2 0 0 1 0 0 0 7 3) The optimal solution is to send: 6 planes from NY to Wash 2 planes from NY to Chi 1 plane from Bos to Chi 7 planes from Mia to Atl This will cost \$24,500 4) Even after boston sends one plane out, there will still be 3 extra aircraft, so it doesn't matter 5) We are using all of the planes in NY. If one breaks down, it will change the solution. 6) The constraint that needs to change is instead of writing [planes from Miami] <= 10 , write [planes from Miami] = 10 . (cell L8 and in solver)--Next Page

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

GreenJet - In-Class(Flights Solution NW 1000 NC 2500 1 0 0...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online