2002年国际大学生数学建模竞赛ICM题

2002高教社杯全国大学生数学建模竞赛题目（大专组：C题、D题）●C题、D题任选一题。

●答卷用白色A4纸，第一页为空白页（用于赛区或全国组委会对论文进行编号）。

●论文题目和摘要写在第二页上，从第三页开始是论文正文。

●论文中不能有任何可能显示答题人身份的标志。

●提请大家注意：从去年起，提高了摘要在整篇论文评阅中所占的权重。

●全部题目可以从以下网址之一下载：C题车灯线光源的计算安装在汽车头部的车灯的形状为一旋转抛物面，车灯的对称轴水平地指向正前方，其开口半径36毫米，深度21.6毫米。

经过车灯的焦点，在与对称轴相垂直的水平方向，对称地放置长度为4毫米的线光源，线光源均匀分布。

在焦点F正前方25米处的A点放置一测试屏，屏与FA垂直。

请解决下列问题：1.计算直射光总功率与反射光总功率之比。

2.计算测试屏上直射光的亮区，在有标尺的坐标系中画出其图形。

3.计算测试屏上反射光的亮区，在有标尺的坐标系中画出其图形（只须考虑一次反射）。

D题赛程安排你所在的年级有5个班，每班一支球队在同一块场地上进行单循环赛, 共要进行10场比赛. 如何安排赛程使对各队来说都尽量公平呢. 下面是随便安排的一个赛程: 记5支球队为A, B, C, D, E，在下表左半部分的右上三角的10个空格中, 随手填上1,2,⋯10, 就得到一个赛程, 即第1场A对B, 第2场B对C, ⋯, 第10场C对E. 为方便起见将这些数字沿对角线对称地填入左下三角.这个赛程的公平性如何呢, 不妨只看看各队每两场比赛中间得到的休整时间是否均等. 表的右D则不公平.从上面的例子出发讨论以下问题:1)对于5支球队的比赛, 给出一个各队每两场比赛中间都至少相隔一场的赛程.2)当n支球队比赛时, 各队每两场比赛中间相隔的场次数的上限是多少.3)在达到2) 的上限的条件下, 给出n=8, n=9的赛程, 并说明它们的编制过程.4)除了每两场比赛间相隔场次数这一指标外, 你还能给出哪些指标来衡量一个赛程的优劣, 并说明3) 中给出的赛程达到这些指标的程度.。

美赛历年赛题
美国数学建模竞赛（MCM/ICM）自1985年创办以来已有35年的历史，每年都会发布三个模型问题供参赛选手在限定时间内进行研究和解答。

经过不断发展和完善，MCM/ICM成为了世界范围内最具影响力的数学建模竞赛之一。

以下是MCM/ICM历年来的一些典型赛题：
1985年 MCM A题：研究在给定经济情况下，如何规划BMW公司未来的生产计划及车型。

1987年 MCM A题：在地球上一个非常均匀的平面，建立一个小型城市，考虑各种环境因素如何影响城市的设施和功能。

1991年 MCM D题：分析社会上性别和种族歧视。

1997年 MCM C题：分析为什么珊瑚礁的污染问题比林区污染问题显得更为严重。

2002年 MCM A题：研究货轮舱位的装载问题，最大化收益同时保证船上货物负荷均衡。

2006年 MCM A题：建立模型研究地球大气环境中的水循环，探究人类活动对水循环的影响。

2010年 MCM A题：分析美国电力网络的可靠性，研究如何在自然灾害和人为故障的情况下使电力网络正常运作。

2014年 MCM A题：分析对于Fermi问题和经济增长的数学建模，探究经济增长的限制因素和未来发展趋势。

2018年 MCM A题：研究美国国家公园的野生动植物种类和数量变化，确定如何平衡保护野生动植物和国家公园的多个目的。

从这些题目中可以看出，MCM/ICM的竞赛内容涵盖了众多领域，如管理学、环保、气象、物流、生物学等等。

这不仅考验了参赛选手的数学建模水平，更需要他们具备良好的跨学科素养。

正是这种多学科交叉融合的特性，使得MCM/ICM成为了培养未来数学、理工科人才的重要平台之一。

2002年《数学建模》试题解答要点及部分答案阅卷原则：以假设的合理性、建模的创新性、结果的正确性、文字表述的清晰程度为主要标准.说明：该套题目分为基本题目和分析题，其中分析题应在仔细分析和深入思考的基础上，发挥自己的创造能力，留下独立思考的痕迹.这里给出的答题要点是教师个人的想法，鼓励同学们的其它正确合理的解答.一.（基本题目）（1）在一个密度为ρ的流质表面下深 h 处的压强P=ρgh （g 是重力加速度），试检验此公式的量纲是否正确？（2）在弹簧—质量—阻力系统中，质量为m 的物体在外力F(t)的作用下，在 t 时刻的位置x(t)满足以下方程：)(22t F kx dtdx r dt xd m =++， 其中r 是阻尼系数，k 是弹簧的弹性系数，试确定r, k 的量纲.解答（1）[p] =L —1MT —2, 公式量纲正确；（2）[ r]= MT —1, [k]= MT —2.二. （分析题）一个细菌培养器皿中细菌的繁殖速度很快，目前器皿中有100个细菌，每隔5分钟细菌个数就会加倍，请仔细分析实际情况，建立一个函数表示出 t 时刻的细菌数量.解答 关键语句：“仔细分析实际情况”1．讲义p54的 模型 0,)139.0exp(100≥=t t y 是理想化的结果，不合乎实际情况。

2. 结合实际情况可考虑以下因素：细菌的繁殖、死亡、营养、培养器皿的空间大小等.3．做合理的假设，如：*1 器皿中的营养足够细菌的繁殖需要；*2 细菌个数是连续变化的，细菌的增加理解为自然繁殖个数减去自然死亡个数；*3 培养器皿的空间所限，器皿中存活细菌个数有上限Y M （类似于相对于人类生存的地球）。

4. 对理想化模型进行改进：⎩⎨⎧>≤<=.,;0,)139.0exp(100)(MM M t t Y t t t t y 其中，有M M Y t y =)(。

256注：针对对不同情况的考虑，可做出不同的假设，建立不同的模型.但应考虑马尔萨斯模型是否满足条件“有100个细菌，每隔5分钟细菌个数加倍”.三．(基本题目) （见概率论教材p41）许多人有过这样的经历，进行一次医疗检查，结果呈阳性提示此人患病，但实际上却虚惊一场，究其原因往往是检查的技术水平等因素造成错误所致。

中国大学生数学建模竞赛(CUMCM)历年赛题一览CUMCM从1992年到2007年的16年中共出了45个题目,供大家浏览1992年A.施肥效果分析问题(北京理工大学：叶其孝）B.实验数据分解问题（复旦大学：谭永基）1993年A.非线性交调的频率设计问题（北京大学：谢衷洁）B.足球排名次问题（清华大学：蔡大用）1994年A.逢山开路问题（西安电子科技大学：何大可）B.锁具装箱问题（复旦大学:谭永基，华东理工大学:俞文此）1995年A.飞行管理问题（复旦大学:谭永基，华东理工大学:俞文此）B.天车与冶炼炉的作业调度问题（浙江大学：刘祥官,李吉鸾）1996年A.最优捕鱼策略问题（北京师范大学：刘来福）B.节水洗衣机问题（重庆大学：付鹂）1997年A.零件参数设计问题（清华大学：姜启源）B.截断切割问题（复旦大学:谭永基，华东理工大学:俞文此）1998年A.投资的收益和风险问题（浙江大学：陈淑平）B.灾情巡视路线问题（上海海运学院：丁颂康）1999年A.自动化车床管理问题（北京大学：孙山泽）B.钻井布局问题（郑州大学：林诒勋）C.煤矸石堆积问题（太原理工大学：贾晓峰）2000年A.DNA序列分类问题（北京工业大学：孟大志）B.钢管订购和运输问题（武汉大学：费甫生）C.飞越北极问题（复旦大学：谭永基）D.空洞探测问题（东北电力学院：关信）2001年A.血管的三维重建问题（浙江大学：汪国昭）B.公交车调度问题（清华大学：谭泽光）C.基金使用计划问题（东南大学：陈恩水）2002年A.车灯线光源的优化设计问题（复旦大学:谭永基，华东理工大学:俞文此）B.彩票中的数学问题（解放军信息工程大学：韩中庚）C.赛程安排问题（清华大学：姜启源）2003年A.SARS的传播问题（组委会）B.露天矿生产的车辆安排问题（吉林大学：方沛辰）C.抢渡长江问题（华中农业大学：殷建肃）2004年A.奥运会临时超市网点设计问题(北京工业大学：孟大志)B.电力市场的输电阻塞管理问题(浙江大学:刘康生)C.酒后开车问题（清华大学：姜启源）D.招聘公务员问题（解放军信息工程大学：韩中庚）2005年A.长江水质的评价和预测问题（解放军信息工程大学：韩中庚）B.DVD在线租赁问题(清华大学:谢金星等)C.雨量预报方法的评价问题(复旦大学:谭永基)2006年A.出版社的资源配置问题(北京工业大学：孟大志)B.艾滋病疗法的评价及疗效的预测问题（天津大学：边馥萍）C.易拉罐的优化设计问题（北京理工大学：叶其孝）D.煤矿瓦斯和煤尘的监测与控制问题（解放军信息工程大学：韩中庚）2007年A.中国人口增长预测问题(清华大学：唐云)B.乘公交，看奥运问题（吉林大学：方沛辰，国防科大：吴孟达）C.手机“套餐”优惠几何问题（解放军信息工程大学：韩中庚）D.体能测试时间安排问题（全国组委会）。

【数学中国】历年MCM\ICM赛题、特等奖论文、教程全收入2008CUMCM结束了，2009MCM\ICM又如约而至。

刚刚放松下来，又要开始准备了。

整理了很多资料，很累！话不多说了，现开始第一季：历年赛题特等奖论文、教程下载中，共计450多篇，现在更新完毕！要拿，就来顶！【全集】1985 MCM A 动物群体的管理特等奖论文教程【全集】1985 MCM B 战购物资储备的管理特等奖论文教程【全集】1986 MCM A 水道测量数据特等奖论文评论教程【全集】1986 MCM B 应急设施的位置特等奖论文教程【全集】1987 MCM A 盐的存贮特等奖论文评论【全集】1987 MCM B 停车场设计特等奖论文教程【全集】1988 MCM A 确定毒品走私船的位置特等奖论文评论【全集】1988 MCM B 铁路平板车的装货问题特等奖论文评论【全集】1989 MCM B 飞机排队特等奖论文教程【全集】1990 MCM A 药物在脑内的分布特等奖论文教程【全集】1990 MCM B 扫雪问题特等奖论文教程【全集】1991 MCM A 估计水塔的水流量特等奖论文教程【全集】1991 MCM B 通讯网络的极小生成树特等奖论文教程【部分】1992 MCM A 空中交通控制雷达的功率问题特等奖论文教程【部分】1992 MCM B 应急电力修复系统的修复计划特等奖论文教程【部分】1993 MCM A 加速餐厅剩菜堆肥的生成特等奖论文教程【部分】1993 MCM B 倒煤台的操作方案特等奖论文教程【部分】1994 MCM A 住宅的保温特等奖论文教程【部分】1994 MCM B 计算机网络的最短传输时间特等奖论文教程【全集】1995 MCM A 单一螺旋线特等奖论文教程【全集】1995 MCM B Aluacha Balaclava学院特等奖论文教程【全集】1996 MCM A 噪音场中潜艇的探测特等奖论文教程【全集】1996 MCM B 竞赛评判问题特等奖论文教程【全集】1997 MCM A (疾走龙属)问题特等奖论文教程【全集】1997 MCM B 会议分组特等奖论文教程【全集】1998 MCM A 成绩给分的通胀特等奖论文教程【全集】1998 MCM B 成绩给分的通胀特等奖论文教程【全集】1999 ICM 大地污染特等奖论文教程【全集】1999 MCM A 大碰撞特等奖论文教程【全集】1999 MCM B “非法”聚会特等奖论文教程【全集】2000 ICM 大象群落的兴衰特等奖论文教程【全集】2000 MCM A 空间交通管制特等奖论文教程【全集】2000 MCM B 无线电信道分配特等奖论文教程【全集】2001 ICM 我们的水系—不确定的前景特等奖论文教程【全集】2001 MCM A 选择自行车车轮特等奖论文教程【全集】2001 MCM B 逃避飓风怒吼特等奖论文教程【全集】2002 ICM 蜥蜴问题特等奖论文教程【全集】2002 MCM A 风和喷水池特等奖论文教程【全集】2002 MCM B 航空公司超员订票特等奖论文教程【全集】2003 ICM 航空行李的扫描对策特等奖论文教程【全集】2003 MCM A 特技演员特等奖论文教程【全集】2003 MCM B Gamma刀治疗方案特等奖论文教程【全集】2004 ICM 不可再生资源管理特等奖论文教程【全集】2004 MCM A 指纹是独一无二的吗？特等奖论文教程【全集】2004 MCM B 更快的快通系统特等奖论文教程【全集】2005 ICM 不可再生资源管理特等奖论文教程【全集】2005 MCM A 洪水估计特等奖论文教程【全集】2005 MCM B 公路收费亭的设置特等奖论文教程【全集】2006 ICM 抗击艾滋病的协调特等奖论文教程【全集】2006 MCM A 灌溉喷洒系统的布置与移动问题特等奖论文教程【全集】2006 MCM B 在机场使用轮椅的问题特等奖论文教程【全集】2007 ICM 器官移植：肾交换问题特等奖论文教程【全集】2007 MCM A 不公正的选区划分特等奖论文教程【全集】2007 MCM B 飞机就座问题特等奖论文教程【全集】2008 ICM 寻找好的卫生保健系统特等奖论文教程【部分】2008 MCM A 给大陆洗个澡特等奖论文教程【部分】2008 MCM B 建立数独拼图游戏特等奖论文教程。

AMCM2002问题-A风和喷水池在一个楼群环绕的宽阔的露天广场上，装饰喷泉把水喷向高空。

刮风的日子，风把水花从喷泉吹向过路行人。

喷泉射出的水流受到一个与风速计（用于测量风的速度和方向）相连的机械装置控制，前者安装在一幢邻近楼房的顶上。

这个控制的实际目标，是要为行人在赏心悦目的景象和淋水浸湿之间提供可以接受的平衡：风刮得越猛，水量和喷射高度就越低，从而较少的水花落在水池范围以外。

你的任务是设计一个算法，随着风力条件的变化，运用风速计给出的数据来调整由喷泉射出的水流。

AMCM2002问题-B航空公司超员订票你备好行装准备去旅行，访问New York城的一位挚友。

在检票处登记之后，航空公司职员告诉说，你的航班已经超员订票。

乘客们应当马上登记以便确定他们是否还有一个座位。

航空公司一向清楚，预订一个特定航班的乘客们只有一定的百分比将实际乘坐那个航班。

因而，大多数航空公司超员订票?也就是，他们办理超过飞机定员的订票手续。

而有时，需要乘坐一个航班的乘客是飞机容纳不下的，导致一位或多位乘客被挤出而不能乘坐他们预订的航班。

航空公司安排延误乘客的方式各有不同。

有些得不到任何补偿，有些改订到其他航线的稍后航班，而有些给予某种现金或者机票折扣。

根据当前情况，考虑超员订票问题：航空公司安排较少的从A地到B地航班机场及其外围加强安全性乘客的恐惧航空公司的收入迄今损失达数千万美元建立数学模型，用来检验各种超员订票方案对于航空公司收入的影响，以求找到一个最优订票策略，就是说，航空公司对一个特定的航班订票应当超员的人数，使得公司的收入达到最高。

确保你的模型反映上述问题，而且考虑处理“延误”乘客的其他办法。

此外，书写一份简短的备忘录给航空公司的CEO（首席执行官），概述你的发现和分析。

AMCM2002问题-C如果我们过分扫荡自己的土地，将会失去各种各样的蜥蜴。

佛罗里达灌木蜥蜴是一种灰色或灰褐色小蜥蜴，遍布于佛罗里达中部和大西洋沿岸地区的沙质高地上。

美国大学生数学建模竞赛试题1996 American MCM Problems Problem AThe world's oceans contain an ambient noise field. Seismic disturbances, surface shipping, and marine mammals are sources that, in different frequency ranges,contribute to this field. We wish to consider how this ambient noise might be used to detect large moving objects, e.g., submarines located below the ocean surface. Assuming that a submarine makes no intrinsic noise, developa method for detecting the presence of a moving submarine, its size, and its direction of travel, using only information obtained by measuring changes to the ambient noise field. Begin with noise at one fixed frequency and amplitude.Problem BWhen determining the winner of a competition like the Mathematical Contest inModeling, there are generally a large number of papers to judge. Let's saythere are P=100 papers.A group of J judges is collected to accomplish thejudging. Funding for the contest constains both the number of judges that canbe obtained and amount of time that they can judge. For eample if P=100, thenJ=8 is typical.Ideally, each judge would read paper and rank-order them, but there are toomany papers for this. Instead, there will be a number of screening rounds inwhich each judge will read some number of papers and give them scores. Thensome selection scheme is used to reduce the number of papers under consideration: If the papers are rank-ordered, then the bottom 30% that eachjudge rank-orders could be rejected. Alternatively, if the judges do not rank-order, but instead give them numerical score (say, from 1 to 100),then all papers below some cut-off level could be rejected.The new pool of papers is then passed back to the judges, and the process is repeated.A concern is then the total number of papers that judge reads must besubstantially less than P. The process is stopped when there are only W papersleft. There are the winners. Typically for P=100, W=3.Your task is to determine a selection scheme, using a combination of rank-ordering, numerical scoring, and other methods, by which the final Wpapers will include only papers from among the "best" 2W papers. (By "best",we assume that there is an absolute rank-ordering to which all judges wouldagree.) For example, the top three papers. Among all such methods, the one thatrequired each judge to read the least number of papers is desired.Note the possibility of systematic bias in a numerical scoring scheme. For example, for a specific collection of papers, one judge could average 70points, while another could average 80 points. How would you scale your schemeto accommodate for changes in the contest parameters (P, J, and W)?1997 American MCM ProblemsProblem A The Velociraptor ProblemThe velociraptor,Velociraptor mongoliensis, was a predatory dinosaur that lived during the late Cretaceous period, approximately 75 million years ago. Paleontologists think that it was a very tenacious hunter, and may have hunted in pairs or largerpacks .Unfortunately, there is no way to observe its hunting behavior in the wild as can be done with modern mammalian predators. A group of paleontologists has approached your team and asked for help in modeling the hunting behavior of the velociraptor. They hope to compare your results with field data reported by biologists studying the behaviors of lions, tigers, and similar predatory animals.The average adult velociraptor was 3 meters long with a hip height of 0.5 meters and an approximate mass of 45 kg. It is estimated that the animal could run extremely fast at speed of 60 km/hr for about 15 seconds. After the initial burst of speed ,the animal needed to stop and recover from a buildup of lactic acid in its muscles.Suppose that velociraptor preyed on Thescelosaurus neglectus, a herbivorous biped approximately the same size as the Velociraptor. A biomachanical analysis of a fossilized Thescelosaurus indicates that it could run at a speed of about 50 km/hr. for long period of time.Part1Assuming the velociraptor is a solitary hunter, design a mathematical model that describe a hunting strategy for a single velociraptor stalking and chasing a single Thescelosaurus as well as the evasive strategy of the prey. Assume that the Thescelosaurus can always detect the velociraptor when it comes within 15 meters .but may detect the predator at even greater ranges (up to 50 meters depending upon the habitat and weather conditions. Additionally ,due to its physical structure and strength, the velociraptorhas a limited turning radius when running at full speed. This radius is estimated to be three times the animal's hip height. On the other hand, the Thescelosaurus is extremely agile and has a turning radius of 0.5 meters.Part2Assuming more realistically that the velociraptor hunted in pairs, design a new model that describes a hunting strategy for two velociraptor stalking and chasing a single Thescelosaurus as well as the evasive strategy of the prey. Use the other assumptions and limitations given in Part 1.Problem B Mix Well For Fruitful DiscussionsSmall group meeting for the discussions of important issues, particular long-range planning ,are gaining popularity. It is believed that large groups discourage productive discussion and that a dominant personality will usually control and direct the discussion. Thus ,in corporate board meetings the board will meet in small groups to discuss issues before meeting as a whole, these smaller groups still tun the risk of control by a dominant personality. In an attempt to reduce this danger it is common to schedule several sessions with a different mix of people in each group.A meeting of An Tostal Corporation will be attended by 29 Board Members of which nine are in-house members(i.e., corporate employees).The meeting is to be an all-day affair with three sessions scheduled for the morning and four for the afternoon. Each session will take 45 minutes, beginning on the hour from 9:00 A.M. to 4:00 P.M., with lunch scheduled at noon. Each morning session will consist of six discussion groups with each discussion group led by one of the corporation's six senior officers. None of these officers are board members. Thus each senior officers will not be involved in the afternoon sessions and each of these sessions will consist of only four different discussion groups.The president of the corporation wants a list of board-member assignment to discussion groups for each of the seven sessions. The assignments should achieve as much of a mix of the members as much as possible. The ideal assignment would have each board member in a discussion group the same number of times while minimizing common membership of groups for the different sessions.The assignment should also satisfy the following criteria:1.For the morning sessions ,no board member should be in the same senior officer's discussion group twice.2.No discussion group should contain a disproportionate number of in-house members.Give a list of assignments for members 1-9 and 10-29 and officers 1-6.Indicate how well the criteria in the previous paragraphs are met. Since it is possible that some board members will cancel at the last minute or that some not scheduled will show up, an algorithm that the secretary could use to adjust the assignments with an hour's notice would be appreciated. It would be ideal if the algorithm could also be used to make assignments for future meetings involving different levels of participation for each type of attendee.1998 American MCM ProblemsProblem A MRI ScannersIntroductionIndustrial medical diagnostic machines known as Magnetic Resonance Imager (MRI) scan a three-dimensional object such as a brain, and deliver their results in the form of a three-dimensional array of pixel. Each pixel consists of one number indicating a color or a shade of gray that encodes a measure of water concentration in a small region of the scanned object at the location of the pixel .For instance,0 can picture high water concentration in black (ventricles, blood vessels),128 can picture a medium water concentration in gray(brain nuclei and gray matter),and 255 can picture a low water density in white (liquid-rich white matter consisting of myelinated axons).Such MRI scanners also include facilities to picture on a screen any horizontal or vertical slice through the three-dimensional array (slices are parallel to any of the three Cartesian coordinate axes ).Algorithms for picturing slices through oblique planes ,however ,are proprietary .Current algorithms are limited in terms of the angles and parameter options available ;are implemented only on heavily used dedicated workstations ;lack input capabilities for marking points in the picture before slicing; and tend to blur and "feather out" sharp boundaries between the original pixels.A more faithful, flexible algorithm implemented on a personal computer would be useful.(1)for planning minimally invasive treatments,(2)for calibrating the MRI machines,(3)for investigating structures oriented obliquely in space, such as post-mortem tissue sections in a animal research,(4)for enabling cross-sections at any angle through a brain atlas consisting (4)for enabling cross-sections at any angle through a brain atlas consistingof black-and-white line drawingTo design such an algorithm, one can access the value and locations of the pixels, but not the initial data gathered by the scanners.ProblemDesign and test an algorithm that produces sections of three-dimensional arrays by planes in any orientation in space, preserving the original gray-scale value as closely as possible.Data SetsThe typical data set consists of a three-dimensional array A of numbers A(i,j,k) which indicates the density A(i,j,k) of the object at the location (x,y,z)i,j,k. Typically A(i,j,k) can range from 0 to 255.In most applications the data set is quite large.Teams should design data sets to test and demonstrate their algorithms. The data sets should reflect conditions likely Teams should design data sets to test and demonstrate their algorithms. The data sets should reflect conditions likely to be of diagnostic interest. Teams should also characterize data sets the limit the effectiveness of their algorithms.SummaryThe algorithm must produce a picture of the slice of the three-dimensional array by a plane in space. The plane can have any orientation and any location in space.(The plane can miss some or all data points.)The result of the algorithm should be a model of the density of the scanned object over the selected plane.Problem B Grade InflationBackgroundSome college administrators are concerned about the grading at A Better Class(ABC) college. On average, the faculty at ABC have been giving out high grades(the average grade now given out is an A-),and it is impossible to distinguish between the good and mediocre students .The terms of a very generous scholarship only allow the top 10% of the students to be funded, so a class ranking is required.The dean had the thought of comparing each student to the other students in each class ,and using this information to build up a ranking. For example, if a student obtains an A in a class in which all students obtain an A, then this student is only "average" in this class. On the other hand, if a student obtain the only A in a class, then that student is clearly "above average". Combining information from several classes might allow students to be placed in deciles (top 10%,next 10%,ect.)across the college.ProblemAssuming that the grades given out are(A+,A-,B+,B-,...)can the dean's idea be made to work?Assuming that the grades given out are only (A,B,C,...)can the dean's idea be made to work?Can any other schemes produce a desired ranking?A concern is that the grade in a single class could change many student's deciles. Is this possible?Data SetsTeams should design data sets to test and demonstrate their algorithms. Teams should characterize data sets that limit the effectiveness of their algorithms.Mathematical Contest in Modeling 1999 ProblemsProblem A - Deep ImpactFor some time, the National Aeronautics and Space Administration (NASA) has been considering the consequences of a large asteroid impact on the earth.As part of this effort, your team has been asked to consider the effects of such an impact were the asteroid to land in Antarctica. There are concerns that an impact there could have considerably different consequences than one striking elsewhere on the planet.You are to assume that an asteroid is on the order of 1000 m in diameter, and that it strikes the Antarctic continent directly at the South Pole.Your team has been asked to provide an assessment of the impact of such an asteroid. In particular, NASA would like an estimate of the amount and location of likely human casualties from this impact, an estimate of the damage done to the food production regions in the oceans of the southern hemisphere, and an estimate of possible coastal flooding caused by large-scale melting of the Antarctic polar ice sheet.Problem B - Unlawful AssemblyMany public facilities have signs in rooms used for public gatherings which state that it is "unlawful" for the rooms to be occupied by more than a specified number of people. Presumably, this number is based on the speed with which people in the room could be evacuated from the room's exits in case of an emergency. Similarly, elevators and other facilities often have "maximum capacities" posted.Develop a mathematical model for deciding what number to post on such a sign as being the "lawful capacity". As part of your solution discuss criteria, other than public safety in the case of a fire or other emergency, that might govern the number of people considered "unlawful" to occupy the room (or space). Also, for the model that you construct, consider the differences between a room with movable furniture such as a cafeteria (with tables and chairs), a gymnasium, a public swimming pool, and a lecture hall with a pattern of rows and aisles. You may wish to compare and contrast what might be done for a variety of different environments: elevator, lecture hall, swimming pool, cafeteria, or gymnasium. Gatherings such as rock concerts and soccer tournaments may present special conditions.Apply your model to one or more public facilities at your institution (or neighboring town). Compare your results with the stated capacity, if one is posted. If used, your model is likely to be challenged by parties with interests in increasing the capacity. Write an article for the local newspaper defending your analysis.2000 Mathematical Contest in ModelingProblem A Air traffic ControlDedicated to the memory of Dr. Robert Machol, former chief scientist of the Federal Aviation Agency To improve safety and reduce air traffic controller workload, the Federal Aviation Agency (FAA) is considering adding software to the air traffic control system that would automatically detect potential aircraft flight path conflicts and alert the controller. To that end, an analyst at the FAA has posed the following problems.Requirement A: Given two airplanes flying in space, when should the air traffic controller consider the objects to be too close and to require intervention?Requirement B: An airspace sector is the section of three-dimensional airspace that one air traffic controller controls. Given any airspace sector, how do we measure how complex it is from an air traffic workload perspective? To what extent is complexity determined by the number of aircraft simultaneously passing through that sector (1) at any one instant?(2) during any given interval of time?(3) during a particular time of day? How does the number of potential conflicts arising during those periods affect complexity?Does the presence of additional software tools to automatically predict conflicts and alert the controller reduce or add to this complexity?In addition to the guidelines for your report, write a summary (no more than two pages) that the FAA analyst can present to Jane Garvey, the FAA Administrator, to defend your conclusions.Problem B Radio Channel AssignmentsWe seek to model the assignment of radio channels to a symmetric network of transmitter locations over a large planar area, so as to avoid interference. One basic approach is to partition the region into regular hexagons in a grid (honeycomb-style), as shown in Figure 1, where a transmitter is located at the center of each hexagon.Figure 1An interval of the frequency spectrum is to be allotted for transmitter frequencies. The interval will be divided into regularly spaced channels, which we represent by integers 1, 2, 3, ... . Each transmitter will be assigned one positive integer channel. The same channel can be used at many locations, provided that interference from nearby transmitters is avoided. Our goal is to minimize the width of the interval in the frequency spectrum that is needed to assign channels subject to some constraints. This is achieved with the concept of a span. The span is the minimum, over all assignments satisfying the constraints, of the largest channel used at any location. It is not required that every channel smallerthan the span be used in an assignment that attains the span.Let s be the length of a side of one of the hexagons. We concentrate on the case that there are two levels of interference.Requirement A: There are several constraints on frequency assignments. First, no two transmitters within distance of each other can be given the same channel. Second, due to spectral spreading, transmitters within distance 2s of each other must not be given the same or adjacent channels: Their channels must differ by at least 2. Under these constraints, what can we say about the span in,Requirement B: Repeat Requirement A, assuming the grid in the example spreads arbitrarily far in all directions.Requirement C: Repeat Requirements A and B, except assume now more generally that channels for transmitters within distance differ by at least some given integer k, while those at distance at most must still differ by at least one. What can we say about the span and about efficient strategies for designing assignments, as a function of k?Requirement D: Consider generalizations of the problem, such as several levels of interference or irregular transmitter placements. What other factors may be important to consider?Requirement E: Write an article (no more than 2 pages) for the local newspaper explaining your findings.2001 Mathematical Contest in Modeling (MCM)Problem A: Choosing a Bicycle WheelCyclists have different types of wheels they can use on their bicycles. The two basic typesof wheels are those constructed using wire spokes and those constructed of a solid disk (see Figure 1) The spoked wheels are lighter, but the solid wheels are more aerodynamic.A solid wheel is never used on the front for a road race but can be used on the rear of the bike.Professional cyclists look at a racecourse and make an educated guess as to what kind of wheels should be used. The decision is based on the number and steepness of the hills, the weather, wind speed, the competition,and other considerations. The director sportif of your favorite team would like to have a better system in place and has asked your team for information to help determine what kind of wheel should be used fora given course.Figure 1: A solid wheel is shown on the left and a spoked wheel is shown on the right. The director sportif needs specific information to help make a decision and has asked your team to accomplish the tasks listed below. For each of the tasks assume that the same spoked wheel will always be used on the front butthere is a choice of wheels for the rear.Task 1. Provide a table iving the wind peed at which the power required for a solid rear wheel is less than for a spoked rear wheel. The table should include the wind speeds for different road grades starting from zero percent to ten percent in one percent increments. (Road grade is defined to be the ratio of the total rise of a hill divided by the length of the road. If the hill is viewed as a triangle, the grade is the sine of the angle at the bottom of the hill.) A rider starts at the bottom of the hill at a speed of 45 kph, and the deceleration of the rider is proportional to the road grade.A rider will lose about 8 kph for a five percent grade over 100 meters.Task 2. Provide an example of how the table could be used for a specific time trial courseTask 3. Determine if the table is an adequate means for deciding on the wheel configuration and offer other suggestions as to how to make this decision.Problem B: Escaping a Hurricane's Wrath (An Ill Wind...)Evacuating the coast of South Carolina ahead of the predicted landfallof Hurricane Floydin 1999 led to a monumental traffic jam. Traffic slowed to a standstill on Interstate I-26, which is the principal route going inland from Charleston to the relatively safe haven of Columbia in the center of the state. What is normally an easy two-hour drive took up to 18 hours to complete. Many cars simply ran out of gas along the way.Fortunately, Floyd turned north and spared the state this time, but the public outcry is forcing state officials to find ways to avoid a repeat of this traffic nightmare.The principal proposal put forth to deal with this problem is the reversalof traffic onI-26, so that both sides, including the coastal-bound lanes,have traffic headed inland from Charleston to Columbia. Plans to carry this out have been prepared (and posted on the Web)by the South Carolina Emergency Preparedness Division. Traffic reversal on principal roads leading inland from Myrtle Beach and Hilton Head is also planned.A simplified map of South Carolina is shown. Charleston has approximately 500,000 people, Myrtle Beach has about 200,000 people, and another 250,000 people are spread out along the rest of the coastal strip. (More accurate data,if sought, are widely available.)The interstates have two lanes of traffic in each direction except in the metropolitan areas where they have three. Columbia, another metro area of around 500,000 people, does not have sufficient hotel space to accommodate the evacuees (including some coming from farther northby other routes), so some traffic continues outbound on I-26 towards Spartanburg; on I-77 north to Charlotte; and on I-20 east to Atlanta. In 1999, traffic leaving Columbia going northwest was moving only very slowly. Construct a model for the problem to investigate what strategies may reduce the congestion observed in 1999. Here are the questions that need to be addressed:1.Under what conditions does the plan for turning the two coastal-bound lanes of I-26 into two lanes of Columbia-bound traffic, essentially turning the entire I-26 into one-way traffic, significantly improve evacuation traffic flow?2.In 1999, the simultaneous evacuation of the state's entire coastal region was ordered. Would the evacuation traffic flow improve under an alternative strategy that staggers the evacuation, perhaps county-by-county over some time period consistent with the pattern of how hurricanes affect the coast?3.Several smaller highways besides I-26 extend inland from the coast. Under what conditions would it improve evacuation flow to turn around traffic on these?4.What effect would it have on evacuation flow to establish more temporary shelters in Columbia, to reduce the traffic leaving Columbia?5.In 1999, many families leaving the coast brought along their boats, campers, and motor homes. Many drove all of their cars. Under what conditions should there be restrictionson vehicle types or numbers of vehicles brought in order to guarantee timely evacuation? 6.It has been suggested that in 1999 some of the coastal residents of Georgia and Florida, who were fleeing the earlier predicted landfalls of Hurricane Floyd to the south, came upI-95 and compounded the traffic problems. How big an impact can they have on the evacuation traffic flow? Clearly identify what measures of performance are used to compare strategies. Required: Prepare a short newspaper article, not to exceed two pages,explaining the results and conclusions of your study to the public.问题 A: 选择自行车车轮骑自行车的人有几种不同类型的车轮可以用在他们的自行车上。

2002高教社杯全国大学生数学建模竞赛A 题 车灯线光源的优化设计 参考答案注意：以下答案是命题人给出的，仅供参考。

各评阅组应根据对题目的理解及学生的解答，自主地进行评阅。

一. 假设和简化 (略) 二. 模型的建立建立坐标系如下图，记线光源长度为l ，功率为W ，B,C 点的光强度分别为)(l h B W 和)(l h C W ，先求)(l h B 和)(l h C 的表达式，再建立整个问题的数学模型.以下均以毫米为单位，由所给信息不难求出车灯反射面方程为6022y x z +=，焦点坐标为（0,0,15）。

1) 位于点P(0,w,15)的单位能量的点光源反射到点C(0, 2600, 25015)的能量设反射点的坐标为Q )60,,(22y x y x +.记入射向量为a,该点反射面外法线方向为b ,不难得到反射向量c满足记222y x r +=,由从而得),,(z y x c c c c =的表达式注意到反射光通过C 点,应有其中k 为常数. 从上述第一式可解得0=x两组方程:通过计算可知,存在56.10-≈Cw ,当w 根,即无反射点. 而当C w w 0<时,有两个反射点2,1),60/,,0(2=i y y Q i i i .而第二组方程仅当5609.18119.3-<<-w 时存在满足2236≤r 的一对实根,即有两个反射点),60,,(22y x y x +±记为43,Q Q . 若反射点的坐标为),,(z y x Q ,则位于点)15,,0(w P 的单位能量点光源经Q 点反射到C 点的能量密度(单位面积的能量, 正比于光强度)为 其中而β为反射向量与z 轴的夹角, 2))(),(l h l h C B 的表达式长l 的具有单位能量的线光源位于点)15,,0(w P 的长dw 的微小线光源段反射到C 点的能量密度为 其中长l 的具有单位能量的线光源反射到C 点的能量密度为 类似可得)(l h B 的表达式.相应的反射点方程为相应的,78.00-≈Bw 而第二组方程的有两个反射点的范围为].7800005.0,906.1[--∈w3） 优化设计的数学模型设线光源的功率为W , 则它反射到B 点和C 点的能量密度分别为W l h B ⋅)(和W l h C ⋅)(.问题的数学模型为:三. 模型的求解)(),(l h l h C B 可以用数值积分求得. )(l h B 应具备下列性质：其中B l 为起亮值，'B l 为最大值点，0l 为考察的最大范围，例如取为20mm 。

综合题目参考答案1. 赛程安排(2002年全国大学生数学建模竞赛D 题)(1)用多种方法都能给出一个达到要求的赛程。

(2)用多种方法可以证明支球队“各队每两场比赛最小相隔场次的上界”n r (如=5时上界为1)是，如:n ⎦⎤⎢⎣⎡-23n 设赛程中某场比赛是，两队， 队参加的下一场比赛是，两队(≠i j i i k k )，要使各队每两场比赛最小相隔场次为，则上述两场比赛之间必须有除，j r i ，以外的2支球队参赛，于是，注意到为整数即得。

j k r 32+≥r n r ⎥⎦⎤⎢⎣⎡-≤23n r (3)用构造性的办法可以证明这个上界是可以达到的，即对任意的编排出n 达到该上界的赛程。

如对于=8， =9可以得到:n n 1A 2A 3A 4A 5A 6A 7A 8A 每两场比赛相隔场次数相隔场次总数1A ×159131721253，3，3，3，3，3182A 1×206231126164，4，4，3，2，2193A 520×2410271522，4，4，4，3，2194A 9624×28243192，2，4，4，4，3195A 13231028×41872，2，2，4，4，4186A 171127144×8223，2，2，2，4，4177A 2126153188×124，3，2，2，2，4178A 251621972212×4，4，3，2，2，2171A 2A 3A 4A 5A 6A 7A 8A 9A 每两场比赛相隔场次数相隔场次总数1A ×366311126162114，4，4，4，4，4，4，282A 36×2277221217324，4，4，4，4，4，3273A 62×3515302025103，3，4，4，4，4，4264A 312735×318813234，4，4，4，3，3，3255A 117153×342429193，3，3，3，4，4，4246A 2622301834×49144，4，3，3，3，3237A 1612208244×33283，3，3，3，3，3，4228A 2117251329933×53，3，3，3，3，3，3，219A 13210231914285×3，4，3，4，3，4，324可以看到，=8时每两场比赛相隔场次数只有2，3，4，=9时每两场比n n 赛相隔场次数只有3，4，以上结果可以推广，即为偶数时每两场比赛相隔场n 次数只有，，，为奇数时只有，。

武汉理工大学队员比赛论文mcm2003_A_王蝉娟_唐兵_隗勇mcm2003_A_万丽军_唐涛_陈正旭mcm2003_A王鹏_邓科_刘文慧mcm2003_B_王雨春_钟原_李霜icm2003_C_刘旺_董显_吴辉icm2003_C_夏立_成浩_易科mcm2004_b 厉化金_谷雨_曾祥智mcm2004_b_夏立_赵明杰_高婷全国比赛优秀论文1993年A题非线性交调的频率设计1993年B题球队排名问题1994年A题逢山开路1994年B题锁具装箱1995年A题一个飞行管理模型1995年B题天车与冶炼炉的作业调度1996年A题最优捕鱼策略1996年B题节水洗衣机1997年A题零件的参数设计1997年B题截断切割1998年A题投资的收益和风险1998年B题灾情巡视路线1999年A题自动化车床管理1999年B题钻井布局2000年A题 DNA序列分类2000年B题钢管定购和运输2001年A题血管的三维重建2001年B题公交车调度中国科大老师对美国赛题目的讲解(题目可从往届试题处下载) MCM 1985 A题（王树禾教授）MCM 1985 B题（侯定丕教授）MCM 1986 A题（常庚哲教授，丁友东老师）MCM 1986 B题（李尚志教授）MCM 1988 A题（苏淳教授）MCM 1988 B题（侯定丕教授）MCM 1989 A题（赵林城老师）MCM 1989 B题（侯定丕教授）MCM 1990 A题（王树禾教授）MCM 1990 B题（王树禾教授）MCM 1991 A题（常庚哲教授，丁友东老师）MCM 1992 B题（侯定丕教授）MCM 1993 A题（苏淳教授）MCM 1993 B题（万战勇老师）MCM 1994 B题（程继新老师）美国赛优秀论文MCM 2001 UMAP MCM 2002 UMAPMCM 2003 UMAP MCM 2004 (Quick Pass)。