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

K. Ponnambalam  A. Vannelli  T. E. Unny 《Stochastic Environmental Research and Risk Assessment (SERRA)》1989,3(1):17-29

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.  相似文献   

非充分灌溉制度设计优化模型   总被引：3，自引：3，他引：3       下载免费PDF全文

张展羽  何俊生 《水科学进展》1993,4(3):207-214

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

AN~2 APPLICATION IN THE METRODS OF POPULATION GEOGRAPHY     

Zhang Shulin 《地理学报(英文版)》1995,(1)

1.PoPulation~aphyisthestudy0fthespatialdistributionmdarrangnatsofhumanpoPulation.ItisthesdenceofhowspatialvariarionsinthecomPosihon,growth,whgraion,anddistribLItionofpoPulatonsaiere1ataltospatialvariationsinthenatureofplaces.ThemethodsplayanimPohanroleinr…  相似文献   

水电站水库群模糊优化调度模型与目标协调－模糊规划法   总被引：5，自引：1，他引：5       下载免费PDF全文

谢新民 《水科学进展》1995,6(3):189-197

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

广东省强震台网建设概况     

谢建清 《华南地震》1990,(4)

本文论述了广东省强震台网建设的目的和原则,介绍了台网中使用的强震仪,收取的强震记录和处理情况、台网管理及其展望。  相似文献   

关于卫星网的位置基准及其对联合平差的影响   总被引：1，自引：0，他引：1  

周忠谟  晁定波 《测绘学报》1991,20(4):269-275

  相似文献   

基于动恣规划的整体影像匹配   总被引：1，自引：0，他引：1  

仇彤 《测绘学报》1994,(4)

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

运用人工神经网络作汛期降水预报   总被引：2，自引：0，他引：2  

蔡煜东  宫家文 《气象科学》1994,14(4):386-389

本文提出汛期降水预报的人工神经网络方法，并选择一组标样进行了具体分析，预报成功率达100％，结果表明，该方法性能良好，可望成为汛期降水预报的有效手段。  相似文献   

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

Shenggui Zhang  A. M. Starfield 《Geotechnical and Geological Engineering》1985,3(1):27-34

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     

W. Schaap 《Geotechnical and Geological Engineering》1984,2(1):51-61

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.  相似文献