Open AccessSolving the Optimal Strategy of “Crossing the Desert” Based on Dynamic Programming
Author(s) -
C. Zhou,
Qingxing Liu,
Yuxiang Cai
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1865/4/042005
Subject(s) - contest , computer science , mathematical optimization , dynamic programming , desert (philosophy) , operations research , management science , mathematical economics , artificial intelligence , mathematics , algorithm , economics , political science , law , philosophy , epistemology
In real life, many practical situations need to maximize the benefits under certain conditions. This paper studies the B problem of the 2020 National College Students Mathematical Modeling Contest. Through the establishment of a mathematical model, a combination of weighted undirected graphs, dynamic programming, computer simulation and multi-person non-cooperative models are used to discuss different conditions. The best decision and maximum benefit. For question one, get the maximum benefit of the first and second levels; for question two, solve the strategies that players should adopt for the third and fourth levels; for question three, it is concluded that players should use under normal circumstances Specific strategies.