By Topic

Nonlinear Integer Goal Programming Applied to Optimal System Reliability

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hwang, C.L. ; Dept. of Industrial Engineering; Durland Hall; Kansas State University; Manhattan, Kansas 66506 USA. ; Lee, Hoon Byung ; Tiliman, F.A. ; Lie, Chang Hoon

Few studies have been done on techniques to solve multiple objective nonlinear integer problems. This paper formulates an algorithm for nonlinear integer goal programming using a branch-and-bound method and Hwang & Masud's nonlinear goal programming method. The application of this algorithm is demonstrated by solving reliability problems with single and multiple objectives. The single objective nonlinear integer problem is solved by the nonlinear integer goal programming taking the constraints at priority level one and the objective at priority level two. One interesting feature in this algorithm is that the problem is solved by traditional nonlinear search techniques, such as Hooke and Jeeves pattern search, that are originally intended for solving the ``unconstrained'' problem. However, there is no way to guarantee finding the global optimum for a given problem. This means that the investigator must usually be satisfied with a local optimum or a set of local optima.

Published in:

Reliability, IEEE Transactions on  (Volume:R-33 ,  Issue: 5 )