Case Study: Linear Programming for Cunningham Gudgal Golf Resort Plan
VerifiedAdded on 2023/03/29
|6
|1259
|474
Case Study
AI Summary
This assignment provides a comprehensive linear programming action plan for the Cunningham Gudgal Golf Resort development project. It defines decision variables related to the number of different types of golf holes (straight par 5, dogleg par 5, straight par 4, dogleg par 4, long par 3, and short par 3) and formulates an objective function to maximize the total enjoyment index. The model incorporates various constraints, including minimum and maximum limits on the number of each type of hole, total size limitations, budget constraints, total par constraints, and the total number of holes. The assignment presents several mathematical models including a standard model and exclusive clubhouse models with different options, outlining the constraints and objective functions for each scenario. An alternate model is also provided, offering a different approach to the optimization problem. The goal is to determine the optimal mix of golf holes and clubhouse options to maximize enjoyment while adhering to all project constraints. Desklib provides students access to a wealth of similar solved assignments and past papers.
1 out of 6