An application of Karmarkar's interior-point linear programming algorithm for multi-reservoir operations optimization

Optimization of multi-reservoir systems operations is typically a very large scale optimization problem. The following are the three types of optimization problems solved using linear programming (LP): (i) deterministic optimization for multiple periods involving fine stage intervals, for example, from an hour to a week (ii) implicit stochastic optimization using multiple years of inflow data, and (iii) explicit stochastic optimization using probability distributions of inflow data. Until recently, the revised simplex method has been the most efficient solution method available for solving large scale LP problems. In this paper, we show that an implementation of the Karmarkar's interior-point LP algorithm with a newly developed stopping criterion solves optimization problems of large multi-reservoir operations more efficiently than the simplex method. For example, using a Micro VAX II minicomputer, a 40 year, monthly stage, two-reservoir system optimization problem is solved 7.8 times faster than the advanced simplex code in MINOS 5.0. The advantage of this method is expected to be greater as the size of the problem grows from two reservoirs to multiples of reservoirs. This paper presents the details of the implementation and testing and in addition, some other features of the Karmarkar's algorithm which makes it a valuable optimization tool are illuminated.     

非充分灌溉制度设计优化模型

研究了缺水地区冬小麦灌溉问题.分析了作物模型,作物水分影响函数,并以农作物产量最大为目标,提出了非充分灌溉制度优化设计二维动态规划模型和相应的动态规划逐次逼近(DPSA)求解方法.针对山东省临沂市小埠东灌区的实际情况进行研究,求得了冬小麦三个典型年不同供水水平的最优灌溉制度、排水过程及相应产量.实例表明,模型及方法是合理的.     

水电站水库群模糊优化调度模型与目标协调－模糊规划法

利用大系统和模糊数学规划理论与方法,分析和探讨了水电站水库群模糊优化调度问题,建立了水电站水库群模糊优化调度模型,提出一种目标协调-模糊规划(IB-FP)法.理论分析和实例计算表明,所建立的模糊优化调度模型和提出的IB-FP法是可行和有效的.     

基于动恣规划的整体影像匹配

影像匹配是数字摄影测量工作的基础。考虑到多条核线上的匹配点，本文提出了一种基于动态规划的整体影像匹配方法，构造了一种新的立体匹配模型，并将该模型转化成为简单的一维动态规划模型，采用对角线的方法划分阶段，用视差较和相关系数来构造阶段的代价函数，从而得到了基于动态规划的整体最优匹配结果。     

Dynamic programming with colour graphics smoothing for open-pit design on a personal computer

Summary Dynamic programming is a technique which has been used to design the optimum final surface mining pit limit. In using dynamic programming there is a trade-off: if the geometric constraints are specified too strictly, the pit limit will not be the optimum, but if they are specified more loosely, then the computed pit contours must be smoothed. The smoothing process has usually been manual and is time consuming. In this paper a colour graphics computer routine is presented. This not only facilitates the smoothing but also has the following benefits: open-pit limits can be designed interactively on a personal computer; pit designs that are closer to the economic optimum can be obtained; and the engineer can bring his or her own experience and intuition to bear on the final open-pit design.     

Mill-leach-waste cutoff grades for sulphidic copper ore

Summary Recent mining literature on cutoff grade theory has come to reflect some viewpoints and analyses expressed earlier in the economic literature. Agreement is best when the cutoff grade policy is established by analysis in stages, starting from the limits of the deposit, and using the maximum net present value objective. In the derivation of the optimal cutoff grade policy a dynamic programming approach is then applied to solve the overall problem as a series of linked, nonlinear, stage optimization problems. A wholly satisfactory use of a dynamic programming methodology requires that two conditions be satisfied: the separability and optimality conditions. The former is, strictly, violated by a heap-leaching or dump-leaching process, the latter by possible forms of resource rent taxation. This paper considers the problem of including such a leaching process in a cutoff grade policy analysis along aforementioned lines. It concludes that a workable method of doing so may be found which, in particular, may be quite satisfactory in arid climates where, in addition, some practical leaching experience already exists.     

CRM─PCIPS物化探数据图像处理系统的开发与实现

本文对ＣＲＭ－ＰＣＩＰＳ物化探数据图像处理系统的需要分析、开发环境、系统结构、文件系统、设计编码、程序调试与测试方法做了概括的介绍，并从“软件工程学”的角度对该项开发工作的进程，成功经验与不足之处进行了全面的评述。     

岩(矿)石中真实矿物组成的计算及矿物化学成分的初步逼近

本文基于线性规划的数学模型,利用岩(矿)石化学分析资料,佐以矿物相的鉴定结果,能准确计算出岩(矿)石中真实矿物组成。在没有矿物化学成分分析数据的情况下,通过迭代、逼进,能同时给出岩矿石的真实矿物组成及矿物化学成分的逼近值,若进一步结合矿物晶体化学原理进行修正,可得出更为准确的结果。线性规划的数学模型还能应用于矿物端员组成的计算,天然及人工系统的物理化学平衡、岩石学混合计算等各个方面。     

遗传算法及其在GOMS模型反演中的应用效果分析

几何光学交互遮蔽模型（GOMS）是一种重要的遥感前向模型,它较好解释了“热点”现象,具有较强的前向模拟能力。但由于其固有的非线性性,给反演带来困难。本文尝试采用近年来兴起的并行随机全局寻优算法－遗传算法对GOMS进行反演,并针对传统遗传算法的不足进行了改进。在使用相同先验知识的条件下,将该算法与目前最有效的约束非线性最优化确定性搜索算法－逐步二次规划法对GOMS模型的反演效果进行了比较,结果表明,逐步二次规划法搜索效率较高,但结果受初值的影响很大,初值选择不当,易收敛于局部最优解,而遗传算法具有全局最优的收敛效果,但局部搜索效率较差。在某些对精度要求不高,而对搜索效率要求较高的场合,可以采用遗传算法与确定性搜索算法相结合的混合遗传算法,以提高算法的搜索效率,获得较为满意的效果。     

遵义市海龙坝地下水水质评价与预测的GIS系统

遵义市海龙坝地下水水质评价与预测的GIS系统是以遵义市海龙坝地下水水质评价与预测为研究对象．介绍了基于GIS的地下水水质评价及预测系统的总体设计以及系统实现的功能。并以模糊综合评判模型为例，详细阐述了地下水水质评价与预测系统所实现的评价和预测功能。