CIMS项目网络计划技术中成本优化算法研究

现有的网络计划在描述项目时已不能适应越来越大型和复杂的C IM S项目,为此,对现有网络计划中任务的约束条件及逻辑关系进行了扩充,并给出了扩充网络计划中时间参数的计算.在此基础上,提出了一种基于样本的成本优化算法,有效地解决了实际项目中的成本优化问题.     

Fuzzy-AHP-TOPSIS法在多属性方案优选中的应用——基于油气田开发项目方案优选的研究

基于集成创新的思想,将多属性决策中模糊层次分析法和灰色—正负理想点逼近法优势集成,创建Fuzzy-AHP-TOPSIS法对方案进行最终优劣排序.方法综合考虑了决策者的主观权重和投资项目各影响因素间固有的客观权重、投资风险和收益等诸多因素,为企业投资项目的比选提供了一种新的可靠的决策方法.最后以某气田开发项目-中石油某气田增压开采方案的优选为实例加以说明.     

军事设施建设项目管理综合集成研究

工程建设项目是军事设施建设的重要组分, 对我军建设发展具有深远影响。本文以我军军事设施建设项目管理集成为研究对象, 综合考虑项目成本、进度、质量和安全等参与要素的动态影响关系, 对项目生命周期全过程, 即规划统筹阶段、计划统控阶段、勘察设计阶段、施工建设阶段和跟踪管理阶段进行综合集成管理, 并提出当前可应用于军事设施建设项目综合集成管理的主要方法, 对军事建设项目管理过程进行了优化。     

Logistic曲线拟合方法研究

Logistic模型具有广泛的实用性。本文推导了用三点法估计该模型中参数K值的公式 ,并提出了估计K值的新方法一四点法和拐点法。用 3种方法求出K值后 ,再用线性化回归获得另外两个参数a、r,应用实例研究表明 :3种方法都可得到较高拟合精度 ,其中以四点法最优。而且 ,以这些方法得到的参数估计值作为初始值进行非线性回归 ,易获得 3个参数的最优估计。     

不确定环境下基于时间、费用及鲁棒性权衡的多目标项目调度优化

项目调度中的时间和费用是两个重要的指标,而在不确定环境下进度计划的鲁棒性则是保证项目平稳实施的关键。本文研究不确定环境下的多目标项目调度优化问题,以优化项目的工期、鲁棒值和成本为目标安排各活动的开始时间。基于此,作者构建多目标项目调度优化模型,将模型分解为三个子模型分析目标间的权衡关系,然后设计非劣排序遗传算法进行求解,应用精英保留策略和基于子模型权衡关系的优化策略优化算法,进行算法测试和算例参数敏感性分析。最后,应用上述方法研究一个项目实例,计算得到非劣解集,实例的敏感性分析结果进一步验证了三个目标间的权衡关系,据此提出资源的有效利用策略。本文的研究可以为多目标项目调度制定进度计划提供定量化决策支持。     

基于资源随机中断的反应性多模式项目调度优化

资源中断是项目实施过程中一种常见现象,它会导致项目进度计划的变更并引起额外的成本。本文研究资源随机中断下的项目调度问题,目标是对基准进度计划进行合理的调整,以最小化由此所造成的额外成本。作者首先对研究问题进行界定,随后构建问题的优化模型。针对模型的NP-hard属性,设计禁忌搜索启发式算法。最后以基准列表算法和随机生成算法为参照,在随机生成的标准算例集合上对算法进行测试,得到如下结论:在可接受的计算时间范围内,禁忌搜索获得的满意解质量明显高于其他两种启发式算法;算法的平均计算时间随着项目活动数的增加而增加,随着网络复杂度、资源强度或资源中断次数的增加而减小;满意解的平均目标函数值,随着项目活动数或网络复杂度的增加而增加,随着资源中断次数的增加而减小,与资源强度无明显关系。     

基于主成分分析法的综合评价方法的改进

针对用主成分分析法做综合评价存在的问题,提出了改进的方法即当第一主成分的综合评价值和熵值法得到的综合评价值具有一致性时,将两种评价结果进行集成综合评价,若两种评价结果不具有一致性时则采用主成分聚类法进行综合评价.     

求解物流运输网络SUM-MIN双目标路径问题的扩展标号法

研究了物流运输网络SUM-MIN双目标路径问题. 基于模糊规划方法提出了一种求解SUM-MIN双目标路径问题的目标函数集成方法,以及集成后目标函数的扩展标号法. 在将双目标转化为单目标时,综合考虑了每个目标的边缘评价和两个目标的整体评价因素,通过对每个目标分配的权重将决策者的偏好充分体现到决策过程中,采用广义的模糊目标集成算子形成了相应的折衷规划模型. 最后,通过实例对所提方法进行了说明.     

随机活动工期下考虑缓冲成本及效用的融资费用最小化项目调度优化研究

巨额融资所带来的高昂融资费用，推高承包商的总成本，严重挤压其利润空间。承包商迫切需要对项目现金流进行优化，提高资金配置效率，降低融资费用。此外，为了应对不确定性干扰，承包商通常花费事前成本为活动添加时间缓冲，以保证进度计划稳定性，以减少事后变更和调整费用。因此，本文研究随机活动工期下考虑缓冲成本及效用的融资费用最小化项目调度优化研究，旨在为承包商生成具有一定鲁棒性的融资费用最小化基准进度。首先，界定研究问题并构建优化模型，在此考虑为活动插入时间缓冲所带来的成本及效用。其次，设计VNTS混合算法对模型进行求解，提炼相关性质以提高算法搜索效率，并在算例集合上进行算法测试。最后，通过案例对本文研究进行说明。研究结果可以为随机活动工期下承包商控制融资费用、提高项目收益，提供定量化决策支持。     

基于Vague集理论的IT项目挣值管理

挣值管理是项目管理中广泛采用的一种管理方法,论文探讨将质量管理因素纳入传统的挣值管理之中。基于质量管理中不确定因素的客观存在,论文借助Vague集理论描述项目实施过程中的不确定因素,并借助Vague值表达项目监控点各个工作包的质量达标情况。通过Vague值的基本运算规则得到项目监控点的质量达标程度,进而得到了新的挣值计算公式。论文的研究成果,一方面丰富了项目管理中挣值管理的内涵,使其具有更强的适应性,另一方面也为Vague集理论拓展了应用空间。     

Long-step primal-dual target-following algorithms for linear programming

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.     

Trefftz,collocation, and other boundary methods—A comparison

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     

Volume preserving RK methods for linear systems

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…     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

A note on the biasing of Newton's direction

This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite.     

投入产出技术在计划平衡中的理论与应用

在用投入产出技术作计划平衡时，目前一般采用最终产品法、总产品法及国民收入法等．本文从理论上研究了这些方法的可行性问题，并在此基础上提出一个较理想的综合法．最后附有实例并说明综合法的现实意义．     

Diagonalized multiplier methods and quasi-Newton methods for constrained optimization

Two approaches to quasi-Newton methods for constrained optimization problems inR ⁿ 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.     

s个几乎相等的素数的k次方和(Ⅰ)

假定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次方程。     

A comparison of some ODE solvers which require Jacobian evaluations

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.     

Stabilization of algebraic multilevel iteration methods; additive methods

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.