Abstract

This paper presents a model based on a novel compromised solution method to solve the multi-objective large-scale nonlinear programming (MOLSNLP) problems with block angular structure. In this method, an aggregating function that is developed from TOPSIS and VIKOR is proposed based on the particular measure of ‘‘closeness” to the ‘‘ideal” solution. The decomposition algorithm is utilized to reduce the large-dimensional objective space into a two-dimensional space. Furthermore, two independent solution methods are proposed to solve each nonlinear sub problem respectively. In the last step of proposed method, Single objective nonlinear programming problem is solved to find the final solution. Finally, to justify the proposed method, an illustrative example is provided. Then, the sensitivity analysis is described.

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 call

Disclaimer: 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.