A computational algorithm for solving 0‐1 goal programming with GUB structures and its application for optimization problems in system reliability

Abstract

AbstractUpon to now, system optimal allocation problems such as system reliability and system availability problems have been formulated as single‐objective problems and solved through the use of various well‐developed optimization techniques.However, in this field, there are many problems that cannot be solved without applying MODM (multiple‐objective decision making) methods. These methods deal with multiple objectives that conflict with each other instead of formulating the problem as a single objective programming problem which optimizes only the reliability of the cost function, as is done in previous methods.GP (goal programming) is one of the most powerful MODM tools in this field. In practical MODM problems, many GP problems involve a large number of 0‐1 decision variables and a special type of 0‐1 variable, which arises during the transformation of non‐linear integer programming into 0‐1 linear programming.In this paper, we propose an efficient and specific algorithm for solving large‐scale 0‐1 GP problems in particular structures, which are termed GUB structures. Furthermore, to illustrate the effectiveness of the algorithm proposed here, we introduce two numerical examples from among the problems of system reliability, and compare the algorithm proposed with previous methods.