Interval Entropy Algorithm For Generalized Geometric Programming And Fractional Programming Problems

This paper briefly explain the current research of generalized geometric programming and fractional programming problems,as well as the development at the Interval optimization algorithm,emphatically discussing the Interval entropy algorithm of generalized geometric programming and fractional programming.For the constrained polynomial programming problems,we use the interval analysis method,penalty function and adjustable entropy function to construct the interval extensions of the objective penalty functions and the test rules of region deletion,and then the interval adjustable algorithm for solving constrained polynomial programming problems is constructed.For the constrained quadratic fractional programming problems,according to the characteristics of the problem,an interval adjustable entropy algorithm for quadratic programming with constraints is constructed with penalty function method and adjustable entropy function method.For a class of constrained generalized fractional programming problems,the continuous maximum entropy function method and the continuous adjustable entropy function method are combined with the penalty function method respectively to transform the problems to unconstrained differentiable programming problems.By using the interval analysis method,the interval maximum entropy algorithm and adjustable entropy algorithm are given.A range of problems of the interval entropy algorithm are proven in theoretically and experimentally.In accordance with the interval algorithm founded,we write the programs for conducting calculations,and perform an experiment upon the numerical examples.Both theoretical proof and numerical experiments show that the algorithm is reliable and effective.