Font Size: a A A

Research And Application Of Nonlinear Programming Algorithm Based On Inequality Constraints

Posted on:2022-09-13Degree:MasterType:Thesis
Country:ChinaCandidate:B FengFull Text:PDF
GTID:2480306722958859Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Nonlinear programming problems are essential branches of operational research.And they are also essential fields to solve optimization problems.Compared with the general method of linear programming,the simplex method,the nonlinear programming problems are used in specific application ranges.So more theoretical research is needed.This paper is crammed full of research and applications,which are solution methods for nonlinear programming problems with mixed inequality constraints.In this paper,we have carried out the following research on the solution algorithm of nonlinear programming problem:1)For solving the nonlinear programming problem with mixed constraints,we improve the dimension reduction method and fill function method.The objective function is transformed by usingas the dimension reduction function;then the filling function is constructed at the parameters obtained so that the local extreme point is found according to the function iteration.To obtain the global optimal value point,we return the global extreme point of the original objective function;At the end of this paper,we compare the results and steps and get the average complexity of this kind of joint method is O(nlogn).This method is more accurate.2)For inequality constrained nonlinear programming,firstly,we improve the function of the previous chapter,which is(,*,8)).Then we add the selection steps of initial points so that the facet formula to find the extremum points is calculated iteratively.Afterward,we generate a new acceptance domain.Finally,we add judgment steps,which is1)(,*,8)),to determine the selection of facets.The average complexity of this kind of joint method is O().Above all,the gravity sliding algorithm of the comparative scholar[1]makes the calculation amount reduced.We also increase some steps to improve the process.3)Finally,the application of the improved method is proposed.From the perspective of a refinery gas company,which are the actual problems of supplying natural gas,we make the residential area and the original dispatching modeled and solved.The basic steps of the improved method are further calculated.In chapter four,namely from the basic modeling,such as the physical,mathematical,computer science,and other formulas,we construct inequality constrained nonlinear programming problems.We make the Matlab solution value,genetic algorithm,joint algorithm,and other methods compared,so the results obtain the stability and efficiency of the improved method.Finally,we lead to the feasibility of the improved method and the future problems of the conclusion.This paper is aimed at the problems of nonlinear programming in actual production,which is increasingly extensive and carried out some research.But in many practical cases,many factors are considered,so how to solve the planning problem quickly and effectively is the subject to be developed and improved.Our future outlook is to be able to create more adaptive algorithms to create multiple values for actual production.
Keywords/Search Tags:Nonlinear programming, Dimension reduction algorithm, Constructors, Sliding algorithm
PDF Full Text Request
Related items