Volume 11, Issue 4 (2-2026)
mmr 2026, 11(4): 137-155 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Vakili J, Shahsavan Pour Ahl S. A Novel Method to Analyze and Decompose the Weights in the Weighted Sum Method of a MOLP. mmr 2026; 11 (4) :137-155
URL: http://mmr.khu.ac.ir/article-1-3414-en.html
URL: http://mmr.khu.ac.ir/article-1-3414-en.html
1- University of Tabriz , j.vakili@tabrizu.ac.ir
2- University of Tabriz
2- University of Tabriz
Abstract: (168 Views)
The present study presents a new and applicable method to analyze and decompose the weights set in the weighted sum method. To do this, a linear programming (LP) problem is first designed for each extreme point of the expanded outcome space. Then, it is shown that the extreme optimal solutions of the presented LPs are the gradient vectors of the defining (weak) non-dominated hyperplanes of the expanded outcome space. Then, the set of eligible weights in the weighted sum method is comprehensively studied. The polyhedral and structural soft engineering of the set of all weights yielding the same non-dominated solution is meticulously checked. As a consequence, some structural insights related to the properties of the set of (weak) non-dominated solutions are discussed. Finally, the advantage and validity of the method is presented by a numerical example.
Type of Study: S |
Subject:
Anal
Received: 2024/08/22 | Revised: 2026/02/26 | Accepted: 2025/12/26 | Published: 2026/02/26 | ePublished: 2026/02/26
Received: 2024/08/22 | Revised: 2026/02/26 | Accepted: 2025/12/26 | Published: 2026/02/26 | ePublished: 2026/02/26
Send email to the article author
| Rights and permissions | |
 |
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |
