建筑工程投标报价优选模型

通过建立区间二次规划数学模型、灰色模型、多目标规划等模型，建立材料价格和用量的选择模型，提供投标单位一种便捷的调整工程造价和控制造价的手段。     

An Application of Branch and Cut to Open Pit Mine Scheduling

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.     

一类求解线性约束非线性规划问题的可行方向法

Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。     

2400系列数字源表在二极管测试中的应用

本文章将介绍Kethley2400系列数字源表在二极管测试中的应用及相应的编程算法。     

一种结合知识挖掘的进化规划算法

进化规划是一种进化计算方法。进化规划主要使用随机化技术来实现优化过程。与其它进化算法相比,进化规划只有变异操作,而没有交叉操作,因此变异操作的有效性对进化规划算法的成功至关重要。在传统进化规划算法中,进化规划的变异操作具有完全的随机性,这虽然有利于避免局部极值,但却导致较大的计算量。在本文算法中,将知识挖掘技术引入进化规划之中。知识挖掘技术主要用于发现规则,然后利用发现的规则指导变异操作过程,提高变异操作的效率。最终加快了进化规划算法的速度,而计算效果没有明显下降。通过知识挖掘技术的引入,进化规划算法有了初步的智能特性。将本文所介绍的新算法应用于视频编码的运动估计实验中,结果表明新算法有良好的计算速度和计算精确性。     

面向对象的设计特征与实现语言

在管理信息系统的开发以及分布式数据库系统的设计中，已开始使用面向对象的技术．本文论述了面向对象的设计特征，介绍了用于面向对象设计的各种实现语言，并着重分析了各种实现语言支特面向对象设计的能力．     

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A Kind of direct methods is presented for the solution of optimal control problems with state constraints.These methods are sequential quadratic programming methods.At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and Linear approximations to constraints is solved to get a search direction for a merit function.The merit function is formulated by augmenting the Lagrangian funetion with a penalty term.A line search is carried out along the search direction to determine a step length such that the merit function is decreased.The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadrade programming methods.     

Sun工作站上的一种可视编程工具

本文主要介绍Ｓｕｎ Ｏｐｅｎｗｉｎｄｏｗｓ Ｄｅｖｅｌｏｐｅｒ’ｓ Ｇｕｉｄｅ３．０．１软件的简单使用和主要特点。