Optimal profit for hotel operation

Author

Dale Sikkema

Date of Award

5-1996

Degree Type

Thesis

Degree Name

Master of Science

Major

Mathematics

Major Professor

Julius Smith

Committee Members

Balram S. Rajput, Carl G. Wagner

Abstract

This study deals with finding an optimal rule for accepting customers at a hotel through the course of a day. Previous endeavors have developed heuristic methods for approximating the optimal rule. Found here are the optimal rules for the cases with no reservations allowed and either a single room type or multiple room types. A Dynamic Programming method is used to generate the optimal rules. There does not seem to be any reason why the method used here could not be extended to include the possibility of reservations for some of the customers. Also, this approach may be effective in solving the more general problem of considering multiple night stays. Finally, the approach used here can be applied to similar problems in other industries such as the Airline industry.

Recommended Citation

Sikkema, Dale, "Optimal profit for hotel operation. " Master's Thesis, University of Tennessee, 1996.
https://trace.tennessee.edu/utk_gradthes/10956