共查询到20条相似文献,搜索用时 93 毫秒
1.
2.
3.
考虑一类隐式形式多值向量均衡问题的解的存在性,该类问题包含了多值均衡问题、隐式向量均衡问题、多值变分不等式问题、向量变分不等式问题以及向量互补问题作为其特殊情形.利用广义Fan-Browder不动点定理,得到了拓扑向量空间中该类问题解的存要性定理,该结果推广并统一了已有问题解的存在性结果. 相似文献
4.
研究一类隐式集值向量均衡问题,它是隐式向量均衡问题、隐式变分不等式问题、隐式相补问题、向量均衡问题和向量变分不等式问题等的推广.利用截口定理,在Hausdorff拓扑线性空间的非紧子集上得出了一些隐式集值向量均衡问题解的存在性结果.并且还讨论了该隐式集值向量均衡问题解集的通有稳定性.这些结果推广和统一了近期的一些相关结果. 相似文献
5.
本文通过调查 ,对企业开展现场统计研究工作存在的三个问题 ,即认识问题、条件问题、环境问题 ,进行了阐述与分析 ;提出了促进企业开展现场统计研究工作的四点建议 相似文献
6.
对优化问题的最优值研究是有意义的, 尽管有时并不知道怎样寻求最优值. 研究了几个重要的组合最优化问题的目标值随着输入值变化的连续化性质, 重点研究几个经典的、有代表性的离散优化问题:极小化最大完工时间的排序问题、背包问题、旅行商问题等, 以连续的数学分析思维模式审视离散问题. 最后, 研究了一些近似算法对应的目标函数的性质. 相似文献
7.
蚂蚁爬行的最短路径问题,是讨论在规则立体图形表面上蚂蚁从一点爬到另外一点如何选择路径所走路程最短的问题.此问题背景简单、生动、活泼,而解决此问题中需要运用几何学中两点之间线段最短等基础知识,并渗透了把空间问题转化为平面问题的等基本数学思想方法.对于蚂蚁在立方体、长方体、圆柱、圆锥、圆台表面爬行的最短路径问题,在文[1]、[2]中都进行了一些讨论.同时也有很多老师利用此背景进行了很多行之有效的教学设计. 相似文献
8.
9.
在解析几何复习课上,同学们与我一道从一个简单的题目入手,进行问题研究,得出一般性结论,既解决了问题,同时也向同学们展示了一个问题发现、研究、解决的过程,有效地提高了课堂效率. 相似文献
10.
在经营管理、工程设计、科学研究、军事指挥等方面普遍存在着最优化问题,而实际问题中出现的绝大多数问题都被归纳为非线性规划问题之中。作为带等式、不等式约束的复杂事例,最优化问题的求解向来较为繁琐、困难。适当条件下,非线性互补函数(NCP)可以与约束优化问题相结合,其中NCP函数的无约束极小解对应原约束问题的解及其乘子。本文提出了一类新的NCP函数用于解决等式和不等式约束非线性规划问题,结合新的NCP函数构造了增广Lagrangian函数。在适当假设条件下,证明了增广Lagrangian函数与原问题的解之间的一一对应关系。同时构造了相应算法,并证明了该算法的收敛性和有效性。 相似文献
11.
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). 相似文献
12.
The zero-one knapsack problem is a linear zero-one programming problem with a single inequality constraint. This problem has been extensively studied and many applications and efficient algorithms have been published. In this paper we consider a similar problem, one with an equality instead of the inequality constraint. By replacing the equality by two inequalities one of which is placed in the economic function, a Lagrangean relaxation of the problem is obtained. The relation between the relaxed problem and the original problem is examined and it is shown how the optimal value of the relaxed problem varies with increasing values of the Lagrangean multiplier. Using these results an algorithm for solving the problem is proposed.The paper concludes with a discussion of computational experience. 相似文献
13.
该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题. 相似文献
14.
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. 相似文献
15.
本文旨在针对线性比式和规划这一NP-Hard非线性规划问题提出新的全局优化算法.首先,通过引入p个辅助变量把原问题等价的转化为一个非线性规划问题,这个非线性规划问题的目标函数是乘积和的形式并给原问题增加了p个新的非线性约束,再通过构造凸凹包络的技巧对等价问题的目标函数和约束条件进行相应的线性放缩,构成等价问题的一个下界线性松弛规划问题,从而提出了一个求解原问题的分支定界算法,并证明了算法的收敛性.最后,通过数值结果比较表明所提出的算法是可行有效的. 相似文献
16.
Huiqing Xie Hua Dai 《高等学校计算数学学报(英文版)》2006,15(2):97-106
1 Introduction Structural dynamics design is to design a structure subject to the dynamic characteristics re- quirement, i.e., determine physical and geometrical parameters such that the structure has the given frequencies and (or) mode shapes. This problem often arises in engineering connected with vibration. Recently, Joseph [1], Li et al. [2,3] converted the structural dynamics design to the following inverse eigenvalue problem. GIEP Let x = (x1, , xm)T , and let A(x) and B(x) be real n… 相似文献
17.
18.
现代物流技术中装卸工问题的拟多项式时间可解情况 总被引:10,自引:0,他引:10
装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过。现代物流业的迅速发展,促成和推动装卸工问题的提出和研究。装卸工问题是一个新的NP困难的组合优化问题,本文研究限制情形下的装卸工问题,并证明是拟多项式时间可解的。 相似文献
19.
徐惠芳 《数学年刊A辑(中文版)》2011,32(2):141-160
对一类偏积分-微分方程中参数校准的反问题进行研究.在弱解的框架下,原问题可转化为含具体正则化项的最优化问题.文中证明了该最优化问题的解的存在性和稳定性,并考察了最优解存在的一阶必要条件.另外,证明了当正则化参数足够大时,该最优化问题关于参数a的凸性性质.基于偏积分-微分方程反问题的研究对于金融市场中的模型校准问题具有重要的意义. 相似文献
20.
Kunpeng Li Appa Iyer Sivakumar Viswanath Kumar Ganesan 《European Journal of Operational Research》2008
In this paper, we study the problem of synchronized scheduling of assembly and air transportation to achieve accurate delivery with minimized cost in consumer electronics supply chain. This problem was motivated by a major PC manufacturer in consumer electronics industry. The overall problem is decomposed into two sub-problems, which consist of an air transportation allocation problem and an assembly scheduling problem. The air transportation allocation problem is formulated as an integer linear programming problem with the objective of minimizing transportation cost and delivery earliness tardiness penalties. The assembly scheduling problem seeks to determine a schedule ensuring that the orders are completed on time and catch the flights such that the waiting penalties between assembly and transportation is minimized. The problem is formulated as a parallel machine scheduling problem with earliness penalties. The computational complexities of the two sub-problems are investigated. The air transportation allocation problem with split delivery is shown to be solvable. The parallel machine assembly scheduling problem is shown to be NP-complete. Simulated annealing based heuristic algorithms are presented to solve the parallel machine problem. 相似文献