Technical Note—Optimal Pole-Vaulting Strategy
Marvin Hersh and
Shaul P. Ladany
Additional contact information
Marvin Hersh: Emory University, Atlanta, Georgia
Shaul P. Ladany: Ben-Gurion University of the Negev, Beersheva, Israel
Operations Research, 1989, vol. 37, issue 1, 172-175
Abstract:
Under present international track and field rules, a participant in a pole-vaulting competition is entitled to select the heights of his vaulting attempts at all stages of the contest. The restrictions imposed are that sequential vaulting attempts should not be at decreasing bar heights, and that three unsuccessful attempts in succession—at any height—terminates participation in the contest. The last successful vault is the height scored by that participant in the competition. A dynamic programming model has been constructed to provide the optimal set of heights which the competitor should attempt to vault. These will depend on the last height cleared successfully, the total number of previous attempts, and the number of failed attempts since the last success. The strategy is directed at achieving the maximum expected height scored in the competition using readily available experimental data. A numerical example is provided, demonstrating the advantages gained in using the optimal strategy versus traditional patterns.
Keywords: dynamic programming: sports optimization; recreation and sports: pole-vaulting optimization (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.1.172 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:37:y:1989:i:1:p:172-175
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().