抢渡长江最优路径的讨论  

On the Optimal Path of Swimming Race Across the Yangtze River

作　　者：孔敏[1] 姚天行[1] 

机构地区：[1]南京大学数学系,南京210093

出　　处：《数学的实践与认识》2005年第7期136-140,共5页Mathematics in Practice and Theory

摘　　要：给出了2003年全国大学生数学建模竞赛D题的一种求解方法.运用拉格朗日乘数法与变分法建立了水速变化时最优路径适合的方程.特别针对问题4,当水流速度线性变化时,导出了求解最优解的函数方程.In this article, we present a method for solving the problem D in the CUMCM 2003. By applying Lagrange＇s method of multipliers and the variational principle, we establish equations for solving the optimal path fitting for varied speeds of water. For the problem 4,when the speed of water varying with linearity, we educe the functional equations for solving the optimal solutions.

关 键 词：长江 最优路径 数学建模 运动偏角 拉格朗日乘数法 变分原理 

分 类 号：O224[理学—运筹学与控制论]