交巡警服务平台的设置与调度问题解析

本文针对2011年“高教社杯”全国大学生数学建模竞赛B题“交巡警服务平台的设置与调度”问题,首先介绍了问题的背景,然后分析并给出了几个相关具体问题的解决思路和方法,接着简要分析了参赛论文中普遍存在的问题,最后提出了值得进一步研究的八个问题。     

“互联网+”时代的出租车资源配置问题评析

本文针对2015年全国大学生数学建模竞赛的B题“互联网+”时代的出租车资源配置问题,根据评阅和评奖的具体情况,首先介绍了问题的背景、提法和评阅要点,然后给出了问题的几种有代表性解决方法和模型,最后对参赛论文中存在的较普遍的问题做了分析。     

“节水洗衣机”问题数学建模及若干评注

对“节水洗衣机”问题进行了分析,建立了—种数学模型,展示了相应的分析和求解方法,结合1996年全国大学生建模竞赛情况作了若干评注。     

1998年全国大学生数学建模竞赛

<正>由教育部高教司和中国工业与应用数学学会共同主办的“1998年全国大学生数学建模竞赛”于1998年9月22日至24日举行。来自26个省（市、自治区）,400所院校的2103个队参加了这次竞赛。     

货运列车的优化编组调度方案与实现方法

针对2008年全国研究生数学建模竞赛C题"货运列车的编组调度问题",首先介绍了问题的背景和问题的构成,并提出了6个要解决的问题;然后概要地分析介绍了解决这6个具体问题的思想方法;接着给出了具体解决问题的实现方法、主要模型和求解思路;最后对参赛队的总体做法和存在问题情况做了较详细的分析,并就与这个题目有关的几个问题做了说明.     

1996年全国大学生数学建模竞赛

<正> 由国家教委高教司和中国工业与应用数学学会共同主力的“1996年全国大学生数学建模竞赛”于1996年9月24日至26日举行。来自24个省(市、自治区),337所院校的1683个队参加了这次竞赛。     

例谈函数应用问题中的“误区”

函数的应用问题主要是指将实际问题转化为函数问题,就是“数学建模”,它是解决数学应用题的重要方法．在建模时常会因出现“忽视从实际出发”、“理解不全面”、“与事实不符”等几种解题误区,下面就函数应用问题中的这几个误区进行举例分析：     

2011年美国大学生数学建模竞赛简介

美国大学生数学建模竞赛（MCM／ICM）,是一项国际级的竞赛项目,为现今各类数学建模竞赛之鼻祖．MCM／ICM是Mathematical Contestin Modeling和Interdisciplinary Contestin Modeling的缩写,即“数学建模竞赛”和“交叉学科建模竞赛”．MCM始于1985年,ICM始于2000年．由美国自然基金协会和美国数学应用协会共同主办。美国运筹学学会、     

可孤立区域的重金属污染源的估测模型

2011年“高教社杯”全国大学生数学建模竞赛A题“城市表层土壤重金属污染分析”提出了一个从稀疏的污染元素抽样数据估测污染源的问题。本文通过数学建模给出了一个可行的方法。首先,通过建立重金属载体的可压缩流体欧拉连续性方程,并结合问题实际,得到了简化的可压缩流体欧拉连续性方程,建立了沿特征线估测孤立污染源的数学模型;其次,利用稀疏的检测值建立了更切合实际的修正的Shepard插值,设计了沿流线估测可孤立区域污染源的算法;最后,基于所提出的模型和算法,应用赛题数据给出了重金属铜的3个孤立污染源。     

2012年CUMCM A 题解答评析

根据评卷过程中收集到的信息对2012年全国大学生数学建模竞赛的“葡萄酒的评价”问题进行分析,展示了一些较好的模型和结果,并针对答卷中反映的问题提出一些建议。     

Max-min resource allocation

A problem is considered of the allocation of resources so as to maximize the minimum return from several activities. Optimality conditions are given for the case of a single resource, and are used to derive a solution algorithm. Problems with several resources cannot be solved by resourcewise optimization. Concave return functions are treated approximately by linear programming, and optimality or almost optimality of any feasible solution to such a problem can be evaluated by the solution of a linear programming problem. The evaluation measure is extended to certain feasible solutions of problems which have continuous, but not necessarily concave, return functions. A numerical example is given.     

Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems

In this article, we study the minimization of a pseudolinear (i.e. pseudoconvex and pseudoconcave) function over a closed convex set subject to linear constraints. Various dual characterizations of the solution set of the minimization problem are given. As a consequence, several characterizations of the solution sets of linear fractional programs as well as linear fractional multi-objective constrained problems are given. Numerical examples are also given.     

Allocation of dependent divisional resources

A resource allocation problem is considered with resources that are dependent in the sense that an allocation to an activity requires the application of several resources, except for certain activities which are divisional in the sense that an allocation to such an activity requires the use of only a single resource. Return and cost functions are assumed to be continuous and increasing, and the allocation variables are continuous. Conditions are given for the replacement of the continuous problem by an associated problem with discrete variables and a single constraint, and to a given degree of accuracy. The associated problem can be efficiently solved by dynamic programming. Certain divisional resource allocation problems with discrete variables and several linear constraints are shown to be equivalent to a discrete problem with a single constraint. A numerical example is given.     

Numerical solving dynamic problems of elastoplastic deformation of solids

Numerical schemes for solving two-dimensional dynamic problems of elasticity theory based upon several local approximations for each of the required functions are discussed. The schemes contain free parameters (dissipation constants). An explicit form of artificial dissipation of the solutions allows us to control its size and to effectively construct both explicit and implicit schemes. The principle of producing such schemes is applied to a plane dynamic problem of elasticity theory as an example. We describe a class of problems for which numerical algorithms using several local approximations for each of the required functions are constructed. Examples of solving practical problems are given.     

On the Existence and Convergence of the Central Path for Convex Programming and Some Duality Results

This paper gives several equivalent conditions which guarantee the existence of the weighted central paths for a given convex programming problem satisfying some mild conditions. When the objective and constraint functions of the problem are analytic, we also characterize the limiting behavior of these paths as they approach the set of optimal solutions. A duality relationship between a certain pair of logarithmic barrier problems is also discussed.     

More on quasi-random graphs,subgraph counts and graph limits

We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It has been shown by several authors that several such conditions are quasi-random, but that there are exceptions. In order to understand this better, we investigate some new properties of this type. We show that these properties too are quasi-random, at least in some cases; however, there are also cases that are left as open problems, and we discuss why the proofs fail in these cases.The proofs are based on the theory of graph limits; and on the method and results developed by Janson (2011), this translates the combinatorial problem to an analytic problem, which then is translated to an algebraic problem.     

Simulated N-Body: New Particle Physics-Based Heuristics for a Euclidean Location-Allocation Problem

The general facility location problem and its variants, including most location-allocation and P-median problems, are known to be NP-hard combinatorial optimization problems. Consequently, there is now a substantial body of literature on heuristic algorithms for a variety of location problems, among which can be found several versions of the well-known simulated annealing algorithm. This paper presents an optimization paradigm that, like simulated annealing, is based on a particle physics analogy but is markedly different from simulated annealing. Two heuristics based on this paradigm are presented and compared to simulated annealing for a capacitated facility location problem on Euclidean graphs. Experimental results based on randomly generated graphs suggest that one of the heuristics outperforms simulated annealing both in cost minimization as well as execution time. The particular version of location problem considered here, a location-allocation problem, involves determining locations and associated regions for a fixed number of facilities when the region sizes are given. Intended applications of this work include location problems with congestion costs as well as graph and network partitioning problems.     

On fuzzy linear programming

Fuzzy multi-objective and fuzzy Goal Programming are discussed in connection with several membership functions which are used to transform the original problem into three equivalent linear programming problems. Existence and uniqueness theorems are given. Fuzzy duality is presented, and an extension of the initial fuzzy problem arises immediately from it.     

单体型装配问题及其算法

单核苷酸多态性(SNP)单体型装配问题就是从给定的来自某人染色体的SNP片段中去除错误,重构出尽可能与原来片段一致的单体型.这个问题有几个不同的模型最少片段去除(MFR)问题,最少SNP去除(MSR)问题以及最少错误纠正(MEC)问题.前两个问题的复杂性与算法已有一些学者研究过.第三个问题已被证明是NP完全问题,但这个问题的实际算法还没有.该文对MEC问题给出了一个分支定界算法,这个算法能得到问题的全局最优解.通过这个算法对实际数据的计算说明了MEC模型的合理性,即在一定条件下,通过修正最少的错误重构出的单体型确实是真实的单体型.由于分支定界算法对这样一个NP完全问题不能在可接受的时间内解规模较大的问题,文中又给出了求解MEC问题的两个基于动态聚类的算法,以便对规模较大的问题在可接受的时间内得到近似最优解.数值实际表明这两个算法很快,很有效.这两个算法总能得到与分支定界找到的全局最优解很接近的近似最优解.鉴于MEC问题是NP完全的,这两个算法是有效的、实际的算法.     

Nondifferentiability Detection and Dimensionality Reduction in Minisum Multifacility Location Problems

The minisum multifacility location problem is regarded as hard to solve, due to nondifferentiabilities whenever two or more facilities coincide. Recently, several authors have published conditions for the coincidence of facilities. In the present paper, these conditions are extended to more general location problems and improved with respect to new sufficient coincidence conditions for location problems with mixed asymmetric gauges. Some of these conditions are formulated only in terms of the given weights and certain values from a preprocessing step.