Abstract
A class of large-scale non-separable problems is considered, where the overall objective function is not of an additive form with respect to subsystems. The non-separable optimization problem is embedded in a corresponding multiobjective separable optimization problem. A theoretical grounding is established for the original problem's optimal solution, which is attained by a non-inferior solution of the corresponding multiobjective separable optimization problem. A three-level methodology, which decomposes the overall large-scale problem into smaller subproblems and reaches the optimal solution in an iterative way, is also developed.
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.
