| 汽车行驶的时间问题 |
| |
| 引用本文： | 张勇,文家金. 汽车行驶的时间问题[J]. 数学的实践与认识, 2006, 36(8): 189-197 |
| |
| 作者姓名： | 张勇 文家金 |
| |
| 作者单位： | 成都大学数学与计算机科学系,四川,成都,610106 |
| |
| 基金项目： | 国家自然科学基金;四川省教育厅资助项目 |
| |
| 摘 要： | 就d>2R的情形解决如下组合几何极值问题:某平原地区有一个很大的湖泊.湖泊周围有两个村庄A,B.村庄A到村庄B的直线距离为已知.一辆汽车从A村庄出发以已知匀速速度驶向村B庄.问:若这辆汽车以最短路径行驶到达B村庄至多需要多少时间?
|
| 关 键 词： | 区域 最短路径 上确界 S-凸函数 不等式 |
| 修稿时间： | 2005-01-24 |
A Problem of the Time of Running Car |
| |
| ZHANG Yong,WEN Jia-jin. A Problem of the Time of Running Car[J]. Mathematics in Practice and Theory, 2006, 36(8): 189-197 |
| |
| Authors: | ZHANG Yong WEN Jia-jin |
| |
| Abstract: | 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? |
| |
| Keywords: | district shortest path supremum Schur-convex function |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
