Font Size: a A A

Research Of The Solution And The Solution Algorithm Of Multi-objective Optimization

Posted on:2010-04-22Degree:MasterType:Thesis
Country:ChinaCandidate:X WangFull Text:PDF
GTID:2120360308477116Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
A branch of mathematical programming. Study of more than one objective function in a given area on the optimization. Also known as multi-objective optimization.Is usually denoted by VMP.In this paper, multi-objective linear programming has made a comprehensive summing up, first of all by example leads to multi-objective linear programming model, after introducing its history, introduced its various solution sets and some related properties, and then for multi-objective linear programming solution method to do a more comprehensive presentation and the related nature of the proof.The main innovation in this work is given a class of multi-objective programming model solution, the solution of multi-objective bilevel programming. In this regard is that although there are many good conclusions, but in the existing solution methods, have various shortcomings, first in the practical problems it is difficult to establish an effective utility function, Furthermore, the results obtained is also very satisfaction with decision-makers makes it difficult to efficient solution.In this paper, on the basis of our predecessors have done a method has been improved,By linear weighted norm ideal point method and KUHN-TUCKER conditions applied to the solution process .The double-layer multi-objective programming problem is transformed into single-layer, and thus obtain satisfactory efficient solution of the original problem. Which has been double-layer mathematical model of multi-objective decision-making as a solution.
Keywords/Search Tags:multi-objective programming, K—T conditions, ideal point
PDF Full Text Request
Related items