灌溉渠系流量最优调配的0-1规划模型

本文根据灌溉配水渠系的运行特点,提出在一定轮期和来水流量限制条件下实现下级配水渠最优组合及其配水时间最优排序的一种0-1规划模型,实例运算表明,这种方法可有效减少无效弃水和闸门调节次数,同时对渠道横断面的设计有参考意义。     

Biodegradation of Linear Alkyl Benzene Sulphonate

The paper researches on the degradation of LAS (Linear Alkyl benzene Sulphonate) by combining AS1.860 immobilized with low intensity ultrasonic irradiation. The paper also discusses the influence of pH, rotary velocity, LAS concentration and the condition of low intensity ultrasonic irradiation on the degradation of LAS, the degradation rate of LAS is the main index of our experiment, the results of orthogonal test shows that low ultrasonic irradiation can increase the metabolizing of microorganism cells and facilitate the biodegradation of immobilized cells to LAS, here we research the degradation condition of 50mg/L LAS simulation wastewater with low ultrasonic irradiation, and the results show that the influence is obvious, the optimization degradation rate is about 83%, nine point five percent higher than that of the immobilized cells without ultrasonic irradiation.     

A MIMD PARALLEL ALGORITHM TO SOLVE TRIDIAGONAL TOEPLITZ LINEAR EQUATIONS

The rank one updating formula and the parallel eliminating algorithm for linear recurrence systems ane combined fo form a MTMD parallel algorithm fo solve tridiagonal Toeplitz Cinear equations. This algorithm has a simple strictire and requires onlty a few storages as well as in-terprocessor communications. There is no special demand on the number of processors in the parallel system. The speedup can come dose to p12 comparing with the LU decomposition method (p is the number of processors). It is worth pointing out that it is proposed algcmthn that considels and organizes the parallel arithmetic in the first order linear ricurrence systems with constant coefficients.     

NETWORK FEOW APPROACH TO RELIABILITY EVALUATION IN IARGE SCALE NETWORKS BY MIXING INCREASING ELOW WITH DECREASING FLOW

Based on the maximum flow principle about networks, a network flow approach to reliability evaluation in large scale netwerks ty mixing inereasing flow with decreasing flow is proposed in this paper.This approach gets the initial flow of each branch in a r.etwork associated with a state of the retwork by decreasing flows of some branches correlative to another state of the network.As a result, the number of flow compute required can be reduced enormously.The numerical example shows that the approach is powerful. The comparison of this approach with the minimal cutset one is also given in this paper.     

Third-party Logistics Subcontract Design Based on Bilevel Programming

The research theme of this paper is about how third-party logistics provider design a kind of effective incentive mechanism which can not only avoid the moral hazard behavior of the subcontractor , but also promote subcontractor to raise the serving performance constantly, until obtaining the best TPL performance .Through building bilevel programming model where constructing the Nash equilibrium model this paper, the anthors assume subcontract decision variable as endogenetic variable first, and then analyze the optimal solution with the restraint of Nash equilibrium at the time of decision variable as exogenous variable, push the subcontract relationship research at the principal-agent level into the lay that principal-agent combining with whole contract performance optimal decision.     

SOME PROPERTIES OF FEASIBLE DIRECTIONS

Some properties of feasible direction in the convx case are generalized to, the corresponding properties in generalized covex case and their applications for multiobjective mathematical programming are discussed in this paper.     

RESEARCH ON A KIND OF GREY LINEAR PROGRAMMING AND THEIR DUAL THEORIES

In this paper, a kind of grey linear programming with grey interval coefficients is discussed,the definitions of the first and second whitenized linear programmlngs and the grey dual linear programmings are presented, the relationships between the solutions of the above three kinds of programming and the solution of the primal programming are explored, and some new conclusions are obtained.     

A Dynamic Model for Generation Expansion Planning and Algorithm

This paper discusses the problem of long-range generation expansion planning. A dynamic model for long-range expansion planning is set up and an algorithm-a two-step programming is presented, which is used here in a case.     

A DUAL ALGORITHM OF PIECEWISE LINEAR PROGRAMMING WITH SUCCESSIVELY INCREASING SLOPES

A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes. The concept of the pointer is used to derive the optimality and the feasibility conditions based on the dual simplex principle, which avoids enlarging the scale of the problem due to introducing piecewise variables so that storage and calculating requirements are reduced. Finally,the example is given to demonstrate the effectiveness of the presented algorithm.     

A Study on the Mathematical Models for Two Dimensional Guillotine Cullting-stock

Based on the analysis and study on some existed models for two-dimensional Guillotine Cutting-Stock problem, it is pointed out that some kinds of the models may miss some good cutting patterns,and some may result in inadequate solutions because of only considering the patterns with the smallest waste. A kind of revised two-dimensional cutting-stock models are developed,which transform the two-dimensional problem into the one-dimensional one using the dimension-decreasing heuristic method and whose initial patterns are considered comprehensively. In this kind of models, not only the least waste,but also the other constraints,such as the demands and the relative area of the order plates are considered.