信息管理中成品价格的最优决策

已知某一确定产品A有m+1个生产厂家,n个用户。对产品A的价格最优决策问题,首先建立了数学模型,然后应用非线性规划的方法,通过分段求解得到了问题的最优解。     

Efficient Solutions for Special Zero-One Programming Problems

A zero-one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge—management, data-mining, network flow, graph theory, reliability and statistical studies. Seniority is equally shared. A visiting faculty in School of Management at Ben-Gurion University of the Negev, Israel.     

正式函数程序设计语言FFP在微机上的实现

本文描述了在M68000 DUAL系统上用C语言实现的正式函数程序设计语言FFP-1,从而在微机上证明了FFP-1系统的可行性。由于FFP语言是作用式、归约式的语言,因此采用了图归约机和延迟求值技术。     

Zero-Lifting for Integer Block Structured Problems

This paper deals with the relations between the polyhedron described by the inequalities of a block structured problem and the polyhedra described by the inequalities of the single blocks. In particular, classes of block structured problems are described for which zero-lifting of facet inducing inequalities of a single block yields facet inducing inequalities for the whole problem. Some applications are discussed.     

On Disjunctive Cuts for Combinatorial Optimization

In the successful branch-and-cut approach to combinatorial optimization, linear inequalities are used as cutting planes within a branch-and-bound framework. Although researchers often prefer to use facet-inducing inequalities as cutting planes, good computational results have recently been obtained using disjunctive cuts, which are not guaranteed to be facet-inducing in general.A partial explanation for the success of the disjunctive cuts is given in this paper. It is shown that, for six important combinatorial optimization problems (the clique partitioning, max-cut, acyclic subdigraph, linear ordering, asymmetric travelling salesman and set covering problems), certain facet-inducing inequalities can be obtained by simple disjunctive techniques. New polynomial-time separation algorithms are obtained for these inequalities as a by-product.The disjunctive approach is then compared and contrasted with some other general-purpose frameworks for generating cutting planes and some conclusions are made with respect to the potential and limitations of the disjunctive approach.     

合理制定铁路客票价格的优化模型及算法

在充分考虑出行者和铁路客运部门两方面的利益情况下 ,提出一个双层规划模型以得到在多种交通方式竞争条件下的铁路客票价格制定的最优策略 .既保障了出行者使自己的广义出行费用最小 ,又能使铁路客运部门在运输市场竞争中取得的经济效益最大 .并且给出了求解该模型的 SAB算法。最后用一个简单的算例说明了模型及算法的应用     

ERROR BOUNDS FOR CALCULATION OF THE GITTINS INDICES

For a wide class of semi-Markov decision processes the optimal policies are expressible in terms of the Gittins indices, which have been found useful in sequential clinical trials and pharmaceutical research planning. In general, the indices can be approximated via calibration based on dynamic programming of finite horizon. This paper provides some results on the accuracy of such approximations, and, in particular, gives the error bounds for some well known processes (Bernoulli reward processes, normal reward processes and exponential target processes).     

Agricultural management using the ADELAIS multiobjective linear programming software: A case application

This paper presents an application of the ADELAIS multiobjective linear programming software to farm planning problems in agricultural management. This application is illustrated on a Spanish farm case study initially presented by Romero, Amador and Barco as an application of compromise programming. The method employed here generates a sequence of efficient solutions using interactive utility assessment and satisfaction levels. A compromise solution among three conflicting objectives, i.e. seasonal labor, employment and business profitability, is finally obtained.     

漂移型线性规划理论及应用

到目前为止,有关灰色线性规划问题有不少研究,如灰色预测型线性规划^[1～6]灰色区间型线性规划^[7]等．本文在文献^[1～7]的基础上,针对漂移型线性规划问题,运用参数线性规划理论与方法,对其满意解及其性质等进行探研,并提出了一些新的结论,不仅为漂移型线性规划作了一些理论讨论,而且还以应用实例给予示范．     

一个地区能源规划模型

本文在综合考虑煤矿、电厂、铁路、输电线路的布局，以及电负荷中心、煤消费中心的分布和能源需求量等多因素复杂关系的基础上，提出了１９９０—２０００年内蒙古东部区能源规划模型。采用线性规划和混合整数规划方法在微型计算机上求解，得出数据结果和结论。