About Us   |   Contact Us
An International Publisher for Academic and Scientific Journals
Author Login 
 Author Login
Submit Manuscript
Join Membership
Join As Reviewer
Join As Editor
Pay Publication Fee
Subscribe Hard Copy
Scholars Journal of Arts, Humanities and Social Sciences | Volume-7 | Issue-08
Solution of Dynamic Programming Problem Based on LINGO—Take the Shortest Path Problem as an Example
Weijuan Shi*
Published: Aug. 25, 2019 | 128 130
DOI: 10.36347/sjahss.2019.v07i08.004
Pages: 566-568
Downloads
Abstract
The shortest path problem is widely used in real life. It possesses important practical value which how to solve the shortest path problem quickly. LINGO is a powerful tool for solving planning problems. This paper solves the shortest path problem based on LINGO.