The Approximate Method of Quadratic Function With Mixed Constraint

A reduced method to solve the problem with equality constraints is given. Based on the reference we use nonlinear equality constraints, the approximate algorithm is obtained. The nonlinear programming of quadratic function with equality and unequality constraints is discussed by Wang kairong. We transform unequality constraints into equality constraints by add to relaxation variable, the quadratic programming is obtained by linear approximation, and approximate calculation is done by means of reduced method. The result of numerical calculation shows the method is feasible.     

The Generalized Conjugate Direction Method for Constrained Optimization A Geometrical Approech

The conjugate direction method for solving the unconstrained optimization problem is extended to solving the constrained optimization problem by method of differential geomtry.By inducing a new class of affine connections on a constrained sub-manifold, the primary constrched optilnhation problem is converted to a unconstrained local quadratic programming problem.Based on the definition and construction of a new class of generalized conjugate directions, it isproved that optimum value of the primary constrained optimization problem must be located on thegeodesic line which is formed by the conjugate directions mentioned above and can be reached withinfinite searching step. Therefore a new curve search algorithm with generalized conjugate directions isput forward.     

A New Heuristic Evolutionary Programming and Its Application in Solution of the Optimal Power Flow

A new algorithm,based on the combination of the evolutionary programming with the traditional gradient adjustment technique,is presented for solving the optimal power flow problem which describes some technical problems(representations of candidate solutions,evaluation function,mutation operator).Its efficiency is higher than that of general evolutionary programming.     

Descending Dimension Algorithmfor Quadratic Programming Problem

This paper deals with the linear equations algorithm for quadratic programming problems with equality constraints.In this paper the optimality conditions were used for programming problem with equality constraints and then a linear equation was established. Finally the solution of these leads to optimal solution of quadratic programming problems.     

Fuzzy Transportation Problem and Its Hybrid Intelligent Algorithm

The authors investigate a more practical transportation problem under fuzzy environment, that is , capacities of supplies and demands in the transportation problem are fuzzy variables. To obtain a directive decision, the authors construct a mathematical model for the fuzzy transportation problem based chance constrained programming and dependent chance programming in fuzzy environment. In addition, since there are many complex fuzzy variables in the mathematical model, the authors design the genetic algorithm to solve the model based on fuzzy simulation. Finally, they give a numerical example to show the efficiency of the algorithm.     

TRUST REGION METHOD FOR UNCONSTRAINED OPTIMIZATION

A new trust region algorithm is proposed for solving unconstrained optimization problems. According to the quadratic approximate model of the original optimization problem,the trust region algorithm uses directions,a convex combination of the quasi-newton direction and the steepest descent direction. This algorithm with new strategy is analyzed and the global and local quadratic convergent theorems are proved. At last,the implementation and computational results of the algorithm are demonstrated.     

Combination Forecasting Models Using Regression Analysis Method

Using regression analysis method,the methods for solving the weights of combination forecasting model(CFM) are proposed. At first, the linear regress CFM are presented based on the least absolute criteria and least square criteria. Then the weights can be evaluated using the least square princinple. Because the objective function of CFM based on least absolute criteria is non differential, the traditional programming methods can not solve it. So the least square method with the modified weights is proposed to solve this problem. At the same time, methods for solving CFM is given with the aim of minimizing sum of percentage error absolutes. From many cases, the results show that the forecasting precision of CFM is very high and the effect of regression is remarkable.     

APPLICATION OF OUT-OF-KILTER ALGORITHM TO ECONOMIC DISPATCH WITH SECURITY

This paper reports on the application of "Out-of-Kilter Algorithm" (OKA) to the real power economic dispatch with security constraints. The network flow programming is characterized by simple manipulation, fast and reliable convergence, while the OKA can treat nonzero lower bounds and may initiate with any set of flows (including infeasible flow) which satisfies Conservation of flow. The major procedure and numerical example of OKA are given in this paper. The calculating results for economic dispatch on test systems have shown that the method is feasible and effective.     

A Globally Convergent Algorithm for Nonlinear Programming

A new globally convergent algorithm was presented for a continuous differen-tiable nonlinear programming by defining a measure function deviating from the Kuhn-Tucker point. With this algorithm which can be used to get the optimum solution of the problem,the optimal lagrangian multiplier corresponding the optimal solution of the problem was also obtained. A new iterative algorithm for quadratic programming is obtained when applying the general algorithm to quadratic programming. Finally,a numerical example was given.     

the Autolisp Programming Method Processing the Data of the Function of Mechanical and Electrical Products

This paper has briefly stated the necessit of applying the computer to processing automatically the data of the function of mechanical and electrical products. It has also presented the method which can solve this practical problem. The method is AutoLISP programming design. Besides, It has summarized the features of LISP and A oLISP language and the principles of the AutoLISP programming method. With examples.     

APPLICATION OF A CONVEX NETWORK FLOW PROGRAMMING TO THE ECONOMIC POWER DISPATCH

Analyses the characteristics of convex network flow programming of the economic power dispatch with security and presents a rapid algorithm. The numerical examples are given to demonstrate the effectiveness of the algorithm.     

On a New Lower Order Exact Penalty Function

For the inequality constrained nonlinear programming problem, the antnors propose a new lower order penalty function, which combines the classical l1 penalty function and the lower order exact penalty function introduced in thoy some papers, and then illustrate that it has the merits of the two penalty functions. In additional, we propose a solution method for solving the inequality constrained nonlinear programming problem and prove its global convergence.     

Application of Evolutionary Programming in Optimal Reactive Power Dispatch

This paper describes an application of evolutionary programming(EP) to reactive power optimization and voltage control of power systems.Some technical problems which conclude mutation sacle,fitness value and population size have been solved to make EP practical for solving the optimal power flow problems.The computational results with EP have been compared with those obtained from a conventional gradient based optimization method.The comparision shows that EP are better than conventional methods in dealing with the optimization of noncontinuous and nonsmooth funcnons.The EP show the ability to search for the global optimum in reactive optimization that has multiple optima.     

Descending Dimension Algorithm for Convex Nonlinear Programming Problem with Equality Constraints

This paper deals with the nonlinear system of equations algorithm for convex nonlinear programming problems with equality constraints.We use the optimatily conditions for programming problem with equality constraints and then estabish a nonlinear system of equations.Finally we solve these to get optimal solution of nonlinear programming problems.     

INTRODUCTION TO A NEW AUTOPROGRAMMING SYSTEM FOR NC LATHE

This paper deals with the BCH autoprogramming system based on the principle of "representing shap with numbers", With this system, the organization of turning process can be accomplished by inputting only some codes and a few characteristic parameters, and the NC block instructions to control the NC lathe via control unit can be output in turn so that it is possible to write a part program at the shop floor which is benifitian for developing a new programming method to be used in a multistage computer manage system with communicating interface.     

Descending Dimension Algorithm of Nolinear Programming Problem with Linear Inequality Constraints

The general nonlinear programming with linear constraints was investigated. In the algorithm, the method of contributing set was used. Comparing with the general contributing set method, the descending dimension method was used to solve the sub-problem with equality constraints in iterative procedure and the problem with inequality constraints. The algorithm is effective by the numerical test. Finally, it was proved that the iteration points are descending, when the objective functions are convex.     

Realization of Distribution Power Recoering with Dynamic Programming

Distribution power reconflguration is realization of distribution power recovering. The target is not only to recover power supply immediately for the non-trouble area, but also meet the capacity of the line load, the least wire lose, the least operating steps, keeping lines balance and the highest reliability. At present most researches focus how to separate trouble quickly and how to recover the non-trouble area. Few researches discussed selecting optimized recovering path. The problem to realize distribution power recovering is a new task in the distribution power field. Examples prove it is a simple, fast, practically and efficient method to select the best path to recover the non-trouble area with dynamic programming and non-linear multi-object technology.     

Reliability evaluation algorithm for complex electrical distribution networks using the storage structure of adjacency multilist

A section algorithm of reliability evaluation for complex medium voltage Electrical Distribution Networks (EDNs) using adjacency multilist (AM) is proposed. The constructing method for AM is introduced. The AM can be used to store the structure data of EDNs and to solve the problem of space & time complexity. A new power flow algorithm of backward / forward sweep is proposed and a fast algorithm of forming sections in distribution network is put forward. The proposed algorithm makes a perfect combination of the power flow algorithm and the section algorithm of reliability evaluation, which makes efforts to decrease the work of programming and saves the computing time. Applying the proposed algorithm in RBTS-BUS6 system and actual EDNs, the reliability assessment results show that the algorithm has an advantage of saving time and possesses efficiency in engineering practicality.     

Methods,Principles and Problems of CGE Model''s Solving

Computable general equilibrium (CGE)model's solving is important for its reseachers . Though there are many softwares to solve the CGE model, it is very important for its reseachers to understand CGE model's solving principle. The paper introduces the methods,principles and problems of CGE model's solving.The software -MATLAB is used to solve CGE Model, and reseach the existing problem of CGE model's solving.     

THE ECONOMIC DISPATCH OF REAL POWER WITH SECURITY

This paper presents an approach to studing the economic dispatch of real power with N-1 security with the network flow programming (NFP), the N-1 line - security constraints are first introduced into the network f olw model and the problem of N-1 security economic dispatch becomes an incremental metwork flow model. Therefore, the shortage of NFP is mitigated to some extent, The solution adopted is the "out-of-kilter"algorithm(OKA), which is characterized by fast calculation and reliable convergency. The model and solution are tested on IEEE 30-bus system, and the results show that the proposed approach is feasible.