汽车行驶的时间问题  

A Problem of the Time of Running Car

作　　者：张勇[1] 文家金[1] 

机构地区：[1]成都大学数学与计算机科学系,四川成都610106

出　　处：《数学的实践与认识》2006年第8期189-197,共9页Mathematics in Practice and Theory

基　　金：国家自然科学基金(10171073);四川省教育厅自然科学基金(2005A201)

摘　　要：就d>2R的情形解决如下组合几何极值问题:某平原地区有一个很大的湖泊.湖泊周围有两个村庄A,B.村庄A到村庄B的直线距离为已知.一辆汽车从A村庄出发以已知匀速速度驶向村B庄.问:若这辆汽车以最短路径行驶到达B村庄至多需要多少时间?For the case d 〉 2R, the aim of this paper is to solve the following extreme Value problem of combinatorial geometry： There exists a large lake in some plain, and there are two villages named A and B on the lakeside. Assume the line distance between A and B is given. A car wishes to travel from A to B at the given uniform velocity. We ask ： If this car can reach B along the shortest route, how much long this car at most needs the time？

关 键 词：区域 最短路径 上确界 S-凸函数 不等式 

分 类 号：O157.5[理学—数学]