版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Alexandria Univ Fac Sci Dept Math & Comp Sci Alexandria Egypt Higher Technol Inst Dept Basic Sci Tenth Of Ramadan City Egypt
出 版 物:《JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE》 (J. Taibah Univ. Sci.)
年 卷 期:2018年第12卷第5期
页 面:514-519页
核心收录:
主 题:Multi-objective optimization problem weighted Tchebychev metric approach active set Coleman-Li scaling matrix interior-point method
摘 要:In this paper, a reduced interior-point (RIP) algorithm is introduced to generate a Pareto optimal front for multi-objective constrained optimization (MOCP) problem. A weighted Tchebychev metric approach is used together with achievement scalarizing function approach to convert MOCP problem to a single-objective constrained optimization (SOCO) problem. An active-set technique is used together with a Coleman-Li scaling matrix and a decrease interior-point method to solve SOCO problem. A Matlab implementation of RIP algorithm was used to solve three cases and application. The results showed that the RIP algorithm is promising when compared with well-known algorithms and the computations may be superior relevant for comprehending real-world application problems.