摘要
对一块长为11 200m,宽为7 200m的平地矩形区域,运用最优化数学理论,寻求最佳搜索路径.若20人一组搜索,运用整数规划方法建立模型并求解出最短搜索时间为49.03h;若要在48h内完成搜索,运用线性规划方法改进模型并求得最少需22人.
For a flat rectangular area of 11,200× 7,200 square meters, we seek a best search path with respect to certain number of people. If a group of 20 people participates in the search, using the integer programming method, we find the shortest search time is 49.03 hours. To complete the search within 48 hours, using the method of linear programming, we conclude that at least 22 people are needed.
出处
《高等数学研究》
2013年第1期69-70,73,共3页
Studies in College Mathematics
关键词
整数规划
线性规划
地面搜索
integer programming, linear programming, ground search
