替代产品的动态库存决策与控制

考虑了替代产品的动态库存决策与控制问题,建立了替代产品的多周期动态库存决策与控制模型.得到了目标函数的一些重要性质,给出了系统最优参数的求解算法,利用动态规划方法对系统的库存参数进行了优化求解.     

交通网络建设序列的动态规划方法

交通网络建设序列优化是交通规划中一个重要问题。文章对交通网络设计及其建设序列问题的研究现状进行了分析。按照网络建设中规划者和用户间的关系,以交通网络建设序列下的各阶段系统总费用作为上层规划,以各阶段的交通流用户平衡模型作为下层规划,建立了双层规划模型。并依照问题的特点,采用动态规划的求解方法进行探讨,而下层模型则采用了基于路径搜索的GP算法进行求解。并针对网络规划算例进行了计算,针对固定和变动客流OD两种情况下的结果进行了分析。计算的结果表明,问题的双层规划模型和动态规划求解算法能够为路网规划决策提供支持。     

不同风险偏好下虚拟企业风险规划研究

针对虚拟企业风险规划问题,在分析其各种风险具有随机性的特点的基础上,运用随机规划理论,分别建立风险规划的期望值模型和机会约束规划模型来描述决策者在不同风险偏好下的决策行为。针对所建立的模型,分别设计了基于蒙特卡罗模拟的粒子群优化算法、遗传算法和蚁群算法对其进行求解。仿真分析表明期望值模型较好地描述了风险中性决策者的决策行为,机会约束规划模型随着其偏好系数取值的不同描述了不同风险偏好(风险厌恶、风险中性、风险爱好)决策者的决策行为。通过对三种算法仿真结果的比较分析,表明基于蒙特卡罗模拟的粒子群优化算法在寻优能力、稳定性和收敛速度等方面优于其余两种算法,是解决此类风险规划问题的有效手段。     

油田增产措施合理规划的优化模型研究

在考虑均衡使用增产措施的前提下,以油田规划期内增产措施5年的产油量最大为目标,以增产措施的产油量下限、产水量和费用的上限、增产措施的工作量上限为约束条件建立了规划期内增产措施产油量最大的整数线性优化模型,并运用LINDO6.1对模型编程求解和分析,给油田规划提供一个很好的参照.     

基于粒子群算法的非线性二层规划问题的求解算法

粒子群算法（Particle Swarm Optimization，PSO）是一种新兴的优化技术，其思想来源于人工生命和演化计算理论。PSO通过粒子追随自己找到的最好解和整个群的最好解来完成优化。该算法简单易实现，可调参数少，已得到了广泛研究和应用。本文根据该算法能够有效的求出非凸数学规划全局最优解的特点，对非线性二层规划的上下层问题求解，并根据二层规划的特点，给出了求解非线性二层规划问题全局最优解的有效算法。数值计算结果表明该算法有效。     

基于随机规划的建筑集群冷热电联供系统优化研究

面向建筑集群的冷热电联供系统的设计和优化是实现建筑楼宇能源成本节约的重要途径。随机因素对该联供系统的优化决策,具有显著的影响。考虑建筑楼宇的能源需求为随机变量,构建随机混合整数规划模型,解决以最小化建筑楼宇总费用为目标时建筑集群冷热电联供系统的优化问题;其次,提出采用Benders多割平面方法求解多目标规划问题,从而寻找冷热电联供系统的设备配置和系统运行的Pareto最优决策;最后,通过实验验证了模型和算法的有效性。实验结果表明建筑集群在协作模式下,相比于非协作模式,具有更低的总费用。     

基于不同优先级的油田增产多目标规划

为了衡量目标优先级不同对油田增产决策的影响,建立了基于不同优先级的多目标规划模型,并对增油量和措施费用两个目标不同优先级下的模型进行了求解,结果表明,目标优先级不同,油田增产措施的配置结果不同,但主要集中在对有效增产措施的配置上,对于效果较差的增产措施并无差异;同时,目标优先级不同导致目标的最优解相差较大,反映了决策者偏好对油田中后期增产决策的重要性.     

基于控制论的油田开发五年规划模型及其应用

由于油气系统的动态性和复杂性，长期以来油田的五年规划基本上都是采用逐年规划累加来进行代替，整体优化性有待提高。本文从整体优化的角度出发，将整个油气开发系统按其产量构成划分为若干个子系统，在研究总产量与其分项产量之间递变规律的基础上，结合功能模拟建立了油田产量开发系统的状态转移方程，并在此基础上利用目标规划建立了油田五年规划模型。实际应用表明，该模型能很好的解决油田开发的五年规划问题。     

安全约束条件下的经济调度优化模型研究

发电侧放开竞争的电力系统需要更加有效、准确的决策工具对有限的资源进行调度规划。短期经济调度优化问题是一个混合整数非线性规划问题,很难得到有效最优解,尤其是对于大规模电力系统。为了提高求解效率,本文提出了一个考虑安全约束的经济调度优化模型(Security-Constrained Economics Dispatch,SCED),主要采用线性化思想处理经济调度优化问题的模型以及各种约束,采用基于校正的交替求解方法,使得调度优化结果在运行成本最小化的前提下满足系统的安全稳定约束。同时,将本文方法运用到IEEE 30节点系统进行测试,从而验证本文方法有效性。     

基于SEC准则的油田开发规划不确定优化模型及算法

在油价低迷的国际背景下,上市石油公司进行油田开发规划时越来越重视经营效益。美国证券交易委员会(SEC)要求上市石油公司采用产量法计提折耗,极大地影响了石油公司开发规划方案的制定。油田开发受到自然、技术等多种不确定因素的影响,在制定开发规划时需充分考虑这些不确定性。本文基于不确定理论,考虑措施增油效果和新增投资两类不确定参数,以经营效益最大化和新增投资最小化为目标,构建了基于SEC准则的油田开发规划不确定优化模型,并利用差分进化算法求解,给出措施工作量的帕累托解集。本文以D油田年度规划为例,通过构建模型并求解,给出开发规划方案集,并进一步分析SEC储量的下降对上市石油公司经营效益、新增投资回报率、油气总产量、油气完全成本和措施工作量的影响,为企业制定开发规划方案提供参考。     

Three-level Decomposition Approach for Solving Feedstock Problems on Microcomputers

Many decision support systems for feedstock companies include an option for the solution of large linear programming problems. A three-level decomposition algorithm is presented which substantially improves the solution times for such linear programming problems. When decisions must be made on the addition of new raw materials or extra quantities of existing raw materials to feed mixes, the usual approach is to use parametric linear programming. A new approach to this decision problem, based on the results of the three-level decomposition algorithm, is presented in the paper. Finally, implementation issues and the computational performance of the new approaches on real-world problems are discussed.     

A multilevel programming approach to decentralized (or hierarchical) resource allocation systems

In many decision processes there is a hierarchy of decision-makers and decisions are taken at different levels in this hierarchy. In business (and many other practical activities) decision making has changed over the last decades. From a single person (the boss!) and a single criterion (e.g. profit), decision environments have developed increasingly to become multi-person and multi-criteria and even multi-level (or hierarchical) situations. In organization with hierarchical decision systems, the sequential and preemptive nature of the decision process makes the problem of selecting an optimum strategy and action very different from the usual operations research methods. Therefore, a multilevel programming approach is considered in modeling such problems. In particular a three-level mathematical programming model has been proposed for an optimal resource allocation problem in Ethiopian universities. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Developments in linear and integer programming

In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems that can be solved has increased dramatically, the time required to solve problems has decreased substantially and the flexibility of modelling and solving systems has increased steadily. Large models are no longer confined to large computers, and the flexibility of optimisation systems embedded in other decision support tools has made on-line decision making using linear programming a reality (and using integer programming a possibility). The review focuses on recent developments in algorithms, software and applications and investigates some connections between linear optimisation and other technologies.     

Solving non-linear portfolio optimization problems with the primal-dual interior point method

Stochastic programming is recognized as a powerful tool to help decision making under uncertainty in financial planning. The deterministic equivalent formulations of these stochastic programs have huge dimensions even for moderate numbers of assets, time stages and scenarios per time stage. So far models treated by mathematical programming approaches have been limited to simple linear or quadratic models due to the inability of currently available solvers to solve NLP problems of typical sizes. However stochastic programming problems are highly structured. The key to the efficient solution of such problems is therefore the ability to exploit their structure. Interior point methods are well-suited to the solution of very large non-linear optimization problems. In this paper we exploit this feature and show how portfolio optimization problems with sizes measured in millions of constraints and decision variables, featuring constraints on semi-variance, skewness or non-linear utility functions in the objective, can be solved with the state-of-the-art solver.     

Fuzzy goal programming approach to multilevel programming problems

The purpose of this paper is to propose a procedure for solving multilevel programming problems in a large hierarchical decentralized organization through linear fuzzy goal programming approach. Here, the tolerance membership functions for the fuzzily described objectives of all levels as well as the control vectors of the higher level decision makers are defined by determining individual optimal solution of each of the level decision makers. Since the objectives are potentially conflicting in nature, a possible relaxation of the higher level decision is considered for avoiding decision deadlock. Then fuzzy goal programming approach is used for achieving highest degree of each of the membership goals by minimizing negative deviational variables. Sensitivity analysis with variation of tolerance values on decision vectors is performed to present how the solution is sensitive to the change of tolerance values. The efficiency of our concept is ascertained by comparing results with other fuzzy programming approaches.     

Randomized Decisions in Chance-Constrained Programming

Bhattacharyya and Mukherjee have both considered a particular joint randomized decision problem in chance-constrained programming. This paper shows a general approach for solving a large class of similar problems.     

Dominance,potential optimality and alternative ranking in imprecise multi-attribute decision making

In this paper, we introduce a methodology based on an additive multiattribute utility function that does not call for precise estimations of the inputs, such as utilities, attribute weights and performances of decision alternatives. The information about such inputs is assumed to be in the form of ranges, which constitute model constraints and give rise to nonlinear programming problems. This has significant drawbacks for outputting the sets of non-dominated and potentially optimal alternatives for such problems, and we, therefore, propose their transformation into equivalent linear programming problems. The set of non-dominated and potentially optimal alternatives is a non-ranked set and can be very large, which makes the choice of the most preferred alternative very difficult. The above problem is solved by proposing several methods for alternative ranking. An application to the disposal of surplus weapons-grade plutonium is considered, showing the advantages of this approach.     

Solving large-scale mixed-integer programs with fixed charge variables

We consider large-scale mixed-integer programming problems containing fixed charge variables. In practice such problems are frequently approached by using commercial mathematical programming systems. Depending on the formulation, size and structure of the problem this approach may or may not be successful. We describe algorithms for preprocessing and optimization of such problems and discuss the design of an experimental software system based on MPSX/370. Numerical results for solving some large real life problems are also presented.     

The application of optimal control methodology to nonlinear programming problems

Dynamic programming techniques have proven to be more successful than alternative nonlinear programming algorithms for solving many discrete-time optimal control problems. The reason for this is that, because of the stagewise decomposition which characterizes dynamic programming, the computational burden grows approximately linearly with the numbern of decision times, whereas the burden for other methods tends to grow faster (e.g.,n ³ for Newton's method). The idea motivating the present study is that the advantages of dynamic programming can be brought to bear on classical nonlinear programming problems if only they can somehow be rephrased as optimal control problems.As shown herein, it is indeed the case that many prominent problems in the nonlinear programming literature can be viewed as optimal control problems, and for these problems, modern dynamic programming methodology is competitive with respect to processing time. The mechanism behind this success is that such methodology achieves quadratic convergence without requiring solution of large systems of linear equations.     

Revised simplex algorithm for finite Markov decision processes

We introduce a revised simplex algorithm for solving a typical type of dynamic programming equation arising from a class of finite Markov decision processes. The algorithm also applies to several types of optimal control problems with diffusion models after discretization. It is based on the regular simplex algorithm, the duality concept in linear programming, and certain special features of the dynamic programming equation itself. Convergence is established for the new algorithm. The algorithm has favorable potential applicability when the number of actions is very large or even infinite.