Abstract
Multi-objective programming problem is a branch of mathematical programming, and the general method is to transform it into a single objective programming problem. In this paper, in order to consider the different importance of each objective function, \begin{document}$ G1 $\end{document} method for determining the weight of each objective function is proposed. Then, the membership function of each objective function is linearly weighted after being solved, and the multi-objective programming problem is transformed into a single objective programming problem. We obtain and prove the equivalent model of the single objective programming problem, and also obtain the non-inferior solution of the original multi-objective programming problem by solving the optimal solution of the equivalent model. Finally, the feasibility and effectiveness of this method is proved by the example of emergency material dispatch problem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
