expand icon
book An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin cover

An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin

Edition 13ISBN: 978-1439043271
book An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin cover

An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin

Edition 13ISBN: 978-1439043271
Exercise 3
Reconsider the Leisure Airlines problem from Section 5.2. Suppose that as of May 1 the following number of seats have been sold: Reconsider the Leisure Airlines problem from Section 5.2. Suppose that as of May 1 the following number of seats have been sold:    a. Determine how many seats are still available for sale on each flight leg. b. Using the original demand forecasted for each ODIF, determine the remaining demand for each ODIF. c. Revise the linear programming model presented in Section 5.2 to account for the number of seats currently sold and a demand of one additional seat for the Pittsburgh Myrtle Beach Q class ODIF. Resolve the linear programming model to determine a new allocation schedule for the ODIFs.
a. Determine how many seats are still available for sale on each flight leg.
b. Using the original demand forecasted for each ODIF, determine the remaining demand for each ODIF.
c. Revise the linear programming model presented in Section 5.2 to account for the number of seats currently sold and a demand of one additional seat for the Pittsburgh Myrtle Beach Q class ODIF. Resolve the linear programming model to determine a new allocation schedule for the ODIFs.
Explanation
Verified
like image
like image

Linear Programming
Linear programming i...

close menu
An Introduction to Management Science 13th Edition by David Anderson,Dennis Sweeney ,Thomas Williams ,Jeffrey Camm, Kipp Martin
cross icon