多阶段均值—半方差模糊投资组合决策研究

考虑交易成本、借款限制、阀值约束和基数约束,提出多阶段均值—半方差模糊投资组合模型。在该模型中,收益水平被定义为可能的平均回报,风险水平被定义为回报的半方差。由于交易成本和基数约束,多阶段投资组合模型为具有路径依赖性的混合整数动态优化问题。文章提出了前向动态规划方法求解。最后,以一个具体的算例比较了不同的基数约束投资组合的最优投资策略。     

均值绝对偏差资产组合选择模型的算法

对均值绝对偏差模型进行了简化,并利用一种旋转算法求解。这种算法比单纯形算法的计算简便,且计算量更小。利用上海和深圳股市1 072支股票70期周末收盘价所作的实验结果表明,对于资产无上界限制的模型,计算20个不同最优投资组合需要1 274次旋转运算,上界为10%时需要1 570次旋转运算,每 次旋转运算约需1 14171次加法和乘法运算。     

水质预报系统的MPI+OpenMP并行优化研究

OpenMP(Open Multi-Processing)能够在共享存储环境中获得理想的并行性能,MPI＋OpenMP混合并行编程模型更贴近于多核心集群的体系结构。在多核心集群上进行实验,混合模型相对串行程序可缩短95%的运算时间,加速比超过20。实验结果表明,该混合模型比纯MPI并行的系统具有更优的加速比和扩展性,是对纯MPI并行系统的一种改进。     

农业生产风险管理策略的研究

农业生产经营风险管理所涉及的风险因素很多,主要有:(1)单产变化;(2)价格变化;(3)新技术或新知识变化;(4)农业投入水平变化;(5)政府政策变化;(6)法律变化;(7)消费者偏好变化,等等。通过权衡风险和收益,采用适宜的管理策略来规避风险,提高收益,形成了一系列非确定性关系下的风险决策方法。联系河北省20世纪90年代以来农业生产的实际情况,探讨了各种主要的规避或减少农业生产风险的方法和策略,如利用偏相关系数最小的方法选择稳定的生产项目;采用多种经营以分散风险的组合策略;提高农业生产经营灵活性的诸多措施;利用二次规划以建立风险最小而又能保证一定收入水平的最优规划方法等。     

计算机在酸碱溶液pH值计算中的应用

设计了一种计算强酸(碱)及三元以内弱酸(碱)pH 值的通用程序。该程序解决了多元酸(碱)二级电离不可忽略的计算问题,其计算结果与实验值相一致。     

An integrated approach for water resources decision making under interactive and compound uncertainties

In recent years, the issue of water allocation among competing users has been of great concern for many countries due to increasing water demand from population growth and economic development. In water management systems, the inherent uncertainties and their potential interactions pose a significant challenge for water managers to identify optimal water-allocation schemes in a complex and uncertain environment. This paper thus proposes a methodology that incorporates optimization techniques and statistical experimental designs within a general framework to address the issues of uncertainty and risk as well as their correlations in a systematic manner. A water resources management problem is used to demonstrate the applicability of the proposed methodology. The results indicate that interval solutions can be generated for the objective function and decision variables, and a number of decision alternatives can be obtained under different policy scenarios. The solutions with different risk levels of constraint violation can help quantify the relationship between the economic objective and the system risk, which is meaningful for supporting risk management. The experimental data obtained from the Taguchi's orthogonal array design are useful for identifying the significant factors affecting the means of total net benefits. Then the findings from the mixed-level factorial experiment can help reveal the latent interactions between those significant factors at different levels and their effects on the modeling response.     

Extension of the pool-adjacent-violators algorithm

The pool-adjacent-violators algorithm (PAVA) is an efficient algorithm which converges in a finite number of steps. However, it has been applicable so far only in isotonic regression with the simple order. This report extends its applicability to other quadratic programming problems, including certain one-sided multivariate testing problems and concave regression problems.     

Selective Maintenance in System Reliability with Random Costs of Repairing and Replacing the Components

In this paper we consider the problem of determining the optimum number of repairable and replaceable components to maximize a system's reliability when both, the cost of repairing the components and the cost of replacement of components by new ones, are random. We formulate it as a problem of non-linear stochastic programming. The solution is obtained through Chance Constrained programming. We also consider the problem of finding the optimal maintenance cost for a given reliability requirement of the system. The solution is then obtained by using Modified E-model. A numerical example is solved for both the formulations.     

A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming

This paper presents a hybrid genetic algorithm/mathematical programming heuristic for the n-job, m-machine flowshop problems with lot streaming. The number of sublots for each job and the size of sublots are directly addressed by the heuristic and setups may be sequence-dependent. A new aspect of the problem, the interleaving of sublots from different jobs in the processing sequence, is developed and addressed. Computational results from 12 randomly generated test sets of 24 problems each are presented.     

Duality of the improved algebraic method (DIAM)

In this note we present a variant of the improved algebraic method (IAM) using a duality analysis to solve linear programming (LP) problems where more insights to the method are presented. When the coordinates of all vertices are computed, any feasible point can be expressed as a linear combination of the vertices. The objective function is expressed as a weighted sum of its evaluation at the feasible vertices and the optimal point is associated with the highest/lowest coefficient of the weighted sum.