绝对值问题的简解策略

绝对值是中学数学中的重要内容 ,含绝对值符号的问题在数学习题中占有一定的比例 ,这类问题的一般解法是依据绝对值的定义分类讨论去掉绝对值符号 ,进而转化为不含绝对值符号的问题来求解 .这样做解题过程冗长繁琐 ,本文拟介绍几种简解这类问题的常用策略 .1　紧扣概念挖掘隐含条件根据问题中的内在联系和隐含条件 ,充分有效地利用绝对值的原始概念可避免分类讨论 ,从而简化运算过程 .例 1　已知实数 x满足| 2 0 0 0 - x| x - 2 0 0 1=x,求 x - 2 0 0 0 2的值 .解　由二次根式的意义 x≥ 2 0 0 1,此时 ,| 2 0 0 0 - x| =x - 2 0 0 0 ,由已…     

运输问题的退化解及表解中0元的添加

在运输问题表上作业法中,有时会遇到退化解问题,这样在给调运方案时需要在调运表上添加0元,可是0应添在何处?大多数文献中均未具体给出或给出的结论有误,0元的添加不当有时会导致一系列问题出现,本文将讨论这些问题,且给出一个0元添加的确定的答案.     

关于直线过定点问题的思考

<正>直线过定点问题是解析几何里面比较重要的问题,也是学习的难点.其实直线过定点问题通过转化,最终都会回到下面的两种模型,只要使用下面两个模型,直线过定点问题就能迎刃而解.模型1若直线方程能转化成点斜式,即转化为y-y_0=k(x-x_0),则直线过定点(x_0,y_0)     

钢管订购与运输问题一的数学模型与求解

本文针对 2 0 0 0年全国大学生数学建模竞赛 B题—钢管订购与运输问题的问题 ,建立了数学模型 ,并给出了该数学模型的精确求解     

非线性特征值问题的正解

本文着重考察非线性特征值问题u"+λg(t)f(u)=0, 0相似文献   

钢管订购与运输问题三的数学模型与灵敏度分析

本文针对 2 0 0 0年全国大学生数学建模竞赛 B题——钢管订购与运输问题的问题 ( 3) ,建立了数学模型 ,给出了该数学模型的精确求解 .然后对问题 ( 1 )与问题 ( 3)给出了灵敏度分析 .     

一类双曲型方程反问题的存在性与唯一性

针对双曲型方程定解问题{utt=a2uxx+f(t),0xπ,a∈R且a≠0,u(0,t)=v1(t),u(π,t)=v2(t),t0,u(x,0)=g(x),ut(x,0)=h(x),0≤x≤π研究了可以唯一决定未知函数组{v1(t),v2(t),f(t)}的基本条件,提出了该定解问题的反问题,并且讨论了此反问题的存在性与唯一性.     

关于退化方程的一个始值问题

本文考虑只给出一个始值的退化方程的始值问题其中p是实数。 我们得到如下的结果: (ⅰ)若p≠0,φ(x)在x=0的附近解析,则问题(1),(2)在原点附近存在唯一的解析解。 (ⅱ)若p=0,则问题(1),(2)的解析解不唯一。 (ⅲ)若p=0,φ(x)在x=0附近解析,则问题(1),(2)在原点附近解析解存在的充要条件是 φ~((i+4k))(0)=0,(i=2,3;k=0,1,2,…),     

函数零点近似值的探求策略

新课改使学生接触到很多实际问题,而问题的解决往往求助于解方程,对于无公式且不能因式分解的方程,比如超越方程,学生感到束手无策.方程求解也即求函数零点,教材介绍了二分法.为了扩大学生的视野,帮助学生更好地解决实际问题,本文介绍几种零点近似值的探求方法.一、二分法例1求函数f(x)=lnx 2x-6在区间(2,3)内的零点(精确度为0.01).解:设函数f(x)在(2,3)内的零点为x0,用计算器计算得:f(2)<0,f(3)>0x0∈(2,3);f(2.5)<0,f(3)>0x0∈(2.5,3);f(2.5)<0,f(2.75)>0x0∈(2.5,2.75);f(2.5)<0,f(2.5625)>0x0∈(2.5,2.5625);f(2.53125)<0,f(2.5625)>0x0…     

四阶非线性特征值问题的正解

本文考虑了四阶非线性特征值问题d4u/dt4=λg(t)f(u,u″),0＜t＜1,u(0)=u(1)=0,au″(0)-bu″′(0)=0,cu″(1)+du″′(1)=0.其中g(t)∈C((0,1),[0,∞)),f(u,v)∈C([0,∞)×(-∞,0],[0,∞)),a≥0,b≥0,c ≥0,d ≥ 0,且△=ac+ad+bc＞0.利用锥压缩与拉伸不动点定理,获得了上述问题正解的存在性结果.     

The Vehicle Routing-Allocation Problem: A unifying framework

Summary In this paper the Vehicle Routing-Allocation Problem (VRAP) is presented. In VRAP not all customers need be visited by the vehicles. However customers not visited either have to be allocated to some customer on one of the vehicle tours or left isolated. We concentrate our discussion on the Single Vehicle Routing-Allocation Problem (SVRAP). An integer linear programming formulation of SVRAP is presented and we show how SVRAP provides a unifying framework for understanding a number of the papers and problems presented in the literature. Specifically the covering tour problem, the covering salesman problem, the median tour problem, the maximal covering tour problem, the travelling salesman problem, the generalised travelling salesman problem, the selective travelling salesman problem, the prize collecting travelling salesman problem, the maximum covering/shortest path problem, the maximum population/shortest path problem, the shortest covering path problem, the median shortest path problem, the minimum covering/shortest path problem and the hierarchical network design problem are special cases/variants of SVRAP.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

限制情况下装卸工问题的最优解

装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过.现代物流技术迅速发展,促成和推动装卸工问题的提出和研究.装卸工问题是一个新的NP困难的组合优化问题,首先介绍装卸工问题及限制情况下装卸工问题的数学模型,然后分析限制情况下的装卸工问题的性质,最后给出该问题的所有最优解.     

Single machine stochastic JIT scheduling problem subject to machine breakdowns

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.     

一种新的向量互补问题

本文在实局部凸空间中引入了一种新的向量互补问题,这一向量互补问题不仅包含了由Ｙｕ和Ｙａｏ提出的广义向量互补问题由Ｃｈｅｎ和Ｙａｎｇ定义的弱向量互补问题,而且还包含了Ｉｓａｃ意义下的隐互补问题。本文还讨论了新的向量互补问题,向量变分不等式,向量单向极小化问题和最小元问题之间的关系,给出了这一向量互补问题解的存在定理。     

一些约束规划问题的近似全局最优解

首先将一个具有多个约束的规划问题转化为一个只有一个约束的规划问题,然后通过利用这个单约束的规划问题,对原来的多约束规划问题提出了一些凸化、凹化的方法,这样这些多约束的规划问题可以被转化为一些凹规划、反凸规划问题．最后,还证明了得到的凹规划和反凸规划的全局最优解就是原问题的近似全局最优解．     

Pendants-median支撑树及其一个相关问题:复杂性和算法

The complexity status of Pendants-median spanning tree problem is an open problem. Using the complexity of the X3C problem, the paper proves that Pendants-median spanning tree problem is NP-complete. Global-median spanning tree problem is a related problem. Using the complexity of 3SAT, the paper proves that this problem is also NP-complete, and a polynomial -time algorithm to this problem is given, whose time complexity is O(n^3).     

Production planning with discounting and stochastic demands

A general continuous review production planning problem with stochastic demand is considered. Conditions under which the stochastic problem may be correctly solved using an equivalent deterministic problem are developed. This deterministic problem is known to have the same solution as the stochastic problem. Moreover, conditions are established under which the deterministic equivalent problem differs from a commonly used deterministic approximation to the problem only in the interest rate used in discounting. Thus, solving the stochastic problem is no more difficult than solving a commonly used approximation of the problem.     

图论中若干著名问题的历史注记

考察了哥尼斯堡七桥问题,最小生成树问题,旅行推销员问题,分派问题,最大流问题,中国邮递员问题和四色问题等著名图论问题的历史背景.     

Continuous quadratic programming formulations of optimization problems on graphs

Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This continuous formulation is compared to known continuous quadratic programming formulations for the edge separator problem, the maximum clique problem, and the maximum independent set problem. All of these formulations, when expressed as maximization problems, are shown to follow from the convexity properties of the objective function along the edges of the feasible set. An algorithm is given which exploits the continuous formulation of the vertex separator problem to quickly compute approximate separators. Computational results are given.