Branch-and-Bound Redundancy-Optimization for a Series System with Multiple-Choice Constraints

This paper considers a redundancy optimization problem in which multiple-choice and resource constraints are incorporated. The problem is expressed as a nonlinear integer programming problem and is characterized as an NP-hard problem. The purpose of the paper is to develop a SSRP (solution space reduction procedure). Therefore, the problem is analyzed first to characterize some solution properties. An iterative SSRP is then derived using those solution properties. Finally, the iterative SSRP is used to define an efficient B&BP (branch-and-bound procedure) algorithm. Experimental tests show how: dramatically the SSRP can work on removing any intermediately-found unnecessary decision variables from further consideration in solution search, efficient this B&BP is.
Publisher
IEEE-Inst Electrical Electronics Engineers Inc
Issue Date
1999-06
Language
ENG
Keywords

RELIABILITY OPTIMIZATION; ALLOCATION

Citation

IEEE TRANSACTIONS ON RELIABILITY, v.48, no.2, pp.108 - 117

ISSN
0018-9529
URI
http://hdl.handle.net/10203/1161
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
00784268.pdf(856.44 kB)Download
  • Hit : 563
  • Download : 524
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 26 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0