共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
3.
单纯形法选择进出基变元的一个新准则 总被引:1,自引:0,他引:1
解线性规划单纯形法迭代中,G.B.Dantzig等人给出的进基原则看似简单,但其忽略了影响目标函数增加量的另外一个因素—进基变元的产出系数,而试图给出一个新的迭代进出基准则—最大增量准则,一方面可以加快迭代速度,同时也可以避免迭代中可能遇到的所谓循环. 相似文献
4.
本在指献[2]缺点的基础上参考该法优点,对大M法引进人工变量的方式进行了改进,给出了至多引进一个人工变量的求线性规划问题的一种新算法,本方法容易操作,计算量相对较小。 相似文献
5.
讨论了线性规划的单纯形解法,给出了不须加人工变量就可得到一个可行基的算法.通过大量的算例表明此法比传统的单纯形方法具有算法结构简单,计算量小的优点. 相似文献
6.
线性规划联合算法的理论与应用 总被引:6,自引:4,他引:2
本在[1]的基础上.较系统的叙述了线性规划联合算法的步骤、相关理论及其应用,指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。 相似文献
7.
从几何直观入手,对传统单纯形两阶段方法加以分析,得到了变形传统选主元规则的思想和动态选主元策略的思想,并将两种思想在亏基架构下加以实现。由此给出了三种具有动态选主元策略的变形的选主元规则及其相应的亏基算法。数值试验结果表明,两种思相具有可行性。 相似文献
8.
9.
线性规划两阶段法的改进算法 总被引:4,自引:2,他引:2
将单纯形法与对偶单纯形法及其思想结合运用,对两阶段法引进人工变量的方式进行了改进,探索出一种最多引入一个人工变量,即可求得线性规划初始可行基的新算法,能有效地节约计算机的存储量和计算量。 相似文献
10.
有许多文献讨论了线性规划问题中单纯形方法的改进(如文献[1~5]等)。我们在文献[1]的基础上,突破了传统方法中要求单纯形表中的基变量始终非负的想法,给出了求解线性规划问题中一个新的避免人工变量的方法,使其计算量得到减少。 相似文献
11.
Benjamin Jansen Ccs Roos Tamás Terlaky Jean-Philippe Vial 《Mathematical Methods of Operations Research》1996,44(1):11-30
In this paper we propose a long-step target-following methodology for linear programming. This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way. Among these are long-step central and weighted path-following methods and algorithms to compute a central point or a weighted center. Moreover, we use it to analyze a method with the property that starting from an initial noncentral point, generates iterates that simultaneously get closer to optimality and closer to centrality.This work is completed with the support of a research grant from SHELL.The first author is supported by the Dutch Organization for Scientific Research (NWO), grant 611-304-028.The fourth author is supported by the Swiss National Foundation for Scientific Research, grant 12-34002.92. 相似文献
12.
Zi‐Cai Li Tzon‐Tzer Lu Hung‐Tsai Huang Alexander H.‐D. Cheng 《Numerical Methods for Partial Differential Equations》2007,23(1):93-144
In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007 相似文献
13.
1. IntroductionIn recent yearss there has been a great interest in constructing numerical integrationschemes for ODEs in such a way that some qualitative geometrical properties of the solutionof the ODEs are exactly preserved. R.th[ll and Feng Kang[2'31 has proposed symplectic algorithms for Hamiltollian systems, and since then st ruct ure s- preserving me t ho ds fordynamical systems have been systematically developed[4--7]. The symplectic algorithms forHamiltonian systems, the volume-pre… 相似文献
14.
迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法. 相似文献
15.
This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite. 相似文献
16.
在用投入产出技术作计划平衡时,目前一般采用最终产品法、总产品法及国民收入法等.本文从理论上研究了这些方法的可行性问题,并在此基础上提出一个较理想的综合法.最后附有实例并说明综合法的现实意义. 相似文献
17.
R. A. Tapia 《Journal of Optimization Theory and Applications》1977,22(2):135-194
Two approaches to quasi-Newton methods for constrained optimization problems inR
n are presented. These approaches are based on a class of Lagrange multiplier approximation formulas used by the author in his previous work on Newton's method for constrained problems. The first approach is set in the framework of a diagonalized multiplier method. From this point of view, a new update rule for the Lagrange multipliers which depends on the particular quasi-Newton method employed is given. This update rule, in contrast to most other update rules, does not require exact minimization of the intermediate unconstrained problem. In fact, the optimal convergence rate is attained in the extreme case when only one step of a quasi-Newton method is taken on this intermediate problem. The second approach transforms the constrained optimization problem into an unconstrained problem of the same dimension.The author would like to thank J. Moré and M. J. D. Powell for comments related to the material in Section 13. He also thanks J. Nocedal for the computer results in Tables 1–3 and M. Wright for the results in Table 4, which were obtained via one of her general programs. Discussions with M. R. Hestenes and A. Miele regarding their contributions to this area were very helpful. Many individuals, including J. E. Dennis, made useful general comments at various stages of this paper. Finally, the author is particularly thankful to R. Byrd, M. Heath, and R. McCord for reading the paper in detail and suggesting many improvements.This work was supported by the Energy Research and Development Administration, Contract No. E-(40-1)-5046, and was performed in part while the author was visiting the Department of Operations Research, Stanford University, Stanford, California. 相似文献
18.
s个几乎相等的素数的k次方和(Ⅰ) 总被引:1,自引:0,他引:1
孟宪萌 《纯粹数学与应用数学》2002,18(1):5-12
假定pθ‖k,当p=2,2|k时,γ=θ 2;其它情况时,γ=θ 1。而R=П(p-1)|kp^γ。本文在GRH(广义Riemann假设下),证明了当s=2^k 1,1≤k≤11时,任何足够大的整N≡s(modR)都可以表示为s个几乎相等的素数的k次方程。 相似文献
19.
A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step) have been numerically tested and the results compared. They include implicit and explicit processes, and share the property that a Jacobian matrix must be evaluated at least once during the integration. Some of these processes have not been previously described in the literature. 相似文献
20.
Owe Axelsson 《Numerical Algorithms》1999,21(1-4):23-47
There exist two main versions of preconditioners of algebraic multilevel type, the additive and the multiplicative methods.
They correspond to preconditioners in block diagonal and block matrix factorized form, respectively. Both can be defined and
analysed as recursive two-by-two block methods. Although the analytical framework for such methods is simple, for many finite
element approximations it still permits the derivation of the strongest results, such as optimal, or nearly optimal, rate
of convergence and optimal, or nearly optimal order of computational complexity, when proper recursive global orderings of
node points have been used or when they are applied for hierarchical basis function finite element methods for elliptic self-adjoint
equations and stabilized in a certain way. This holds for general elliptic problems of second order, independent of the regularity
of the problem, including independence of discontinuities of coefficients between elements and of anisotropy. Important ingredients
in the methods are a proper balance of the size of the coarse mesh to the finest mesh and a proper solver on the coarse mesh.
This paper presents in a survey form the basic results of such methods and considers in particular additive methods. This
method has excellent parallelization properties.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献