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.     

File Intertransmission Based on WinSock Component

WinSock is a group of API,which is used to transmit data and exchange information on Internet,the Socket Application programme impoldered by users may communicate with other Socket Application programes by Internet. Delphi provides Socket components,which sustains the TCP/IP protocol and makes the Internet programming acquiring much more flexibility.This paper probes that how to realize transmission of files in any format under nonblocking mode between clients and servers by means of Socket components of Delphi.     

Loads Equalization Based on Optimization Principle and the Hierarchical Model for Distribution Networks

Loss reduction is important for distribution networks and it is available to reduce loss by loads equalization. With increasing numbers of vertexes in distribution networks, compounding of loads are rapid increasing. It is hard to achieve the global optimization for load balancing by traditional model of distribution networks. Base on analyzing character of loads equalization for distribution networks, this paper provides a new method which conjugate the optimization principle and the hierarchical model of the distribution networks, can transfer the optimization issues into multi stage decision making problems,and can also achieve the optimization equalization of the distribution networks loads.     

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.     

A Reactive Power OptimlZation Method by Linear Program ming with Secure Correction

This paper presents a reactive power optimization method which combines thelinear programming model with secure correction. In correction. this mOdel presents a new idea inwhich the feasible control region of con trol variables is resolved by over constrained state varlables. This method is quick and reliable and overcomes oscillation of a general linear programming model.     

An Introduction to an Application Software Frarpe Work for Object-Oriented Client /Server

This paper presents the lately released frame work for Client / Server applica-tions software development, stressing on the characteristics of its OOP and Multi-DataBase supports.