Golf course revenue management

This research is based on an analysis of golf course tee‐time reservation practice. Specifically, this article presents a unique linear model that can be used to assign the demand to the available tee‐times, and thus, maximize their utilization and the total revenue. The model is solved by using the SAS‐OR built‐in branch and bound (B&B) algorithm. To reduce the computational time, we propose a heuristic to find an initial feasible solution to the model. This initial solution reduces the CPU time substantially and enabled us to solve the larger‐scale problem by using the SAS‐OR.