Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems

The redundancy allocation problem, which seeks to find the optimal allocation of redundancy that maximizes system reliability, is one of the representative problems in reliability optimization. The problem can be formulated as a nonconvex integer nonlinear programming problem. This paper presents an...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 171; no. 1; pp. 24 - 38
Main Authors:	Ha, Chunghun, Kuo, Way
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.05.2006 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Allocations Applied sciences Branch & bound algorithms Branch-and-bound Exact sciences and technology Integer programming Mathematical programming Operational research and scientific management Operational research. Management science Operations research Optimization Redundancy Redundancy allocation Reliability Reliability theory. Replacement problems Studies Integer programming Branch-and-bound Reliability Redundancy allocation Monotonic function Coherent system Separability Non convex programming Branch and bound method Redundancy Non linear programming System reliability Optimization Optimal allocation Objective function
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	The redundancy allocation problem, which seeks to find the optimal allocation of redundancy that maximizes system reliability, is one of the representative problems in reliability optimization. The problem can be formulated as a nonconvex integer nonlinear programming problem. This paper presents an efficient branch-and-bound approach to solve this problem, where the considered system is coherent, that is, the objective and constraint functions have monotonic increasing properties. The proposed method is based primarily on a search space elimination of disjoint sets in a solution space that does not require any relaxation of branched subproblems. The main advantage of the proposed method is flexibility (i.e., it does not rely on any assumptions of linearity, separability, single constraint, or convexity) which make the method adaptive to various applications. Numerical experiments demonstrate that the method is superior to the existing exact algorithms for redundancy allocation problems in terms of computation time.
AbstractList	The redundancy allocation problem, which seeks to find the optimal allocation of redundancy that maximizes system reliability, is one of the representative problems in reliability optimization. The problem can be formulated as a nonconvex integer nonlinear programming problem. This paper presents an efficient branch-and-bound approach to solve this problem, where the considered system is coherent, that is, the objective and constraint functions have monotonic increasing properties. The proposed method is based primarily on a search space elimination of disjoint sets in a solution space that does not require any relaxation of branched subproblems. The main advantage of the proposed method is flexibility (i.e., it does not rely on any assumptions of linearity, separability, single constraint, or convexity) which make the method adaptive to various applications. Numerical experiments demonstrate that the method is superior to the existing exact algorithms for redundancy allocation problems in terms of computation time. The redundancy allocation problem, which seeks to find the optimal allocation of redundancy that maximizes system reliability, is one of the representative problems in reliability optimization. The problem can be formulated as a nonconvex integer nonlinear programming problem. This paper presents an efficient branch-and-bound approach to solve this problem, where the considered system is coherent, that is, the objective and constraint functions have monotonic increasing properties. The proposed method is based primarily on a search space elimination of disjoint sets in a solution space that does not require any relaxation of branched subproblems. The main advantage of the proposed method is flexibility (i.e., it does not rely on any assumptions of linearity, separability, single constraint, or convexity) which make the method adaptive to various applications. Numerical experiments demonstrate that the method is superior to the existing exact algorithms for redundancy allocation problems in terms of computation time. [PUBLICATION ABSTRACT]
Author	Kuo, Way Ha, Chunghun
Author_xml	– sequence: 1 givenname: Chunghun surname: Ha fullname: Ha, Chunghun email: chriver58@yahoo.com organization: Department of Industrial Engineering, Texas A&M University, College Station, TX 77843-3131, USA – sequence: 2 givenname: Way surname: Kuo fullname: Kuo, Way email: way@utk.edu organization: College of Engineering, University of Tennessee, 124 Perkins Hall, Knoxville, TN 37996-2000, USA
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17507354$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a171_3ay_3a2006_3ai_3a1_3ap_3a24-38.htm$$DView record in RePEc
BookMark	eNp9UU1r3DAQFSWFbtL-gZ5MoUe7kizb2tJLCP0IBAqlPQtJHm1lZGkreZdsf33H2dBCDxGMJEbvzRu9uSQXMUUg5DWjDaOsfzc1MKXccEpFQ_uG0v4Z2TA58LqXPb0gG9oOQ805G16Qy1ImSinrWLchu28QvDY--OVUZRgPcdTRniodQrJ68Sm-r65j5ed9TkcYEaKD__3wULmUK-zDpniE-_UWfASdK4Tusp5nH3fr3QSYy0vy3OlQ4NXjeUV-fPr4_eZLfff18-3N9V1tBW-XutfCipZz55yl0rqtZWNHB-2Y3Q7CmNZI03XaciFG3UnN7ZabLUiN3zPGDe0VeXOui8K_DlAWNaVDjiipOBVMCi4pgm7PoAx7sGqf_azzSQEudBGKOqpWs4HhfsJAV3s8_JrE2K8poVqpfi4z1nr7KKiL1cFltM-XvzXZgO23nUAcP-NsTqVkcP8gVK0zVJNa1dU6Q4WCKIok-R_J-uXB_CVrH56mfjhTAd0-esiqWA_Rwugz2EWNyT9F_wOEFbwb
CODEN	EJORDT
CitedBy_id	crossref_primary_10_1016_j_cie_2018_04_036 crossref_primary_10_1016_j_comcom_2021_04_034 crossref_primary_10_1080_00949655_2021_2022151 crossref_primary_10_1002_qre_2249 crossref_primary_10_1016_j_eswa_2024_123178 crossref_primary_10_33889_IJMEMS_2017_2_4_020 crossref_primary_10_1016_j_jocs_2010_06_001 crossref_primary_10_1109_TR_2015_2484064 crossref_primary_10_1109_TR_2008_2006079 crossref_primary_10_1177_1748006X251338301 crossref_primary_10_33889_IJMEMS_2017_2_3_016 crossref_primary_10_1016_j_apm_2007_09_003 crossref_primary_10_1007_s13369_017_2638_4 crossref_primary_10_1016_j_ress_2022_108795 crossref_primary_10_1287_ijoc_2024_0842 crossref_primary_10_1016_j_cie_2025_111045 crossref_primary_10_1109_TSMCA_2011_2172603 crossref_primary_10_1016_j_ejor_2006_03_057 crossref_primary_10_1155_2021_6385713 crossref_primary_10_1016_j_ejor_2013_05_004 crossref_primary_10_1155_2019_1218925 crossref_primary_10_1007_s10845_017_1311_9 crossref_primary_10_1016_j_cie_2011_09_003 crossref_primary_10_1016_j_isatra_2015_09_015 crossref_primary_10_1007_s00500_015_1641_5 crossref_primary_10_1016_j_ress_2022_108394 crossref_primary_10_1108_IJQRM_06_2011_0090 crossref_primary_10_1002_qre_1685 crossref_primary_10_1007_s13198_024_02613_3 crossref_primary_10_1016_j_jer_2025_03_008 crossref_primary_10_1016_j_ejor_2014_02_031 crossref_primary_10_1007_s10479_008_0408_0 crossref_primary_10_1080_07408170701730800 crossref_primary_10_1080_03610926_2019_1580741 crossref_primary_10_1016_j_ress_2015_07_019 crossref_primary_10_1016_j_ress_2022_108340 crossref_primary_10_1016_j_ress_2015_09_008 crossref_primary_10_1080_00949655_2022_2053126 crossref_primary_10_1080_00949655_2021_1879080 crossref_primary_10_1007_s41872_022_00213_3 crossref_primary_10_1016_j_ress_2019_02_010 crossref_primary_10_1007_s10479_021_04093_1 crossref_primary_10_1016_j_apm_2014_12_019 crossref_primary_10_1287_ijoc_2019_0895 crossref_primary_10_1016_j_ress_2025_111153 crossref_primary_10_1007_s10489_023_04821_z crossref_primary_10_1177_1748006X19825707 crossref_primary_10_1080_03610926_2022_2104873 crossref_primary_10_4028_www_scientific_net_AMM_479_480_861 crossref_primary_10_26634_jwcn_8_4_17178 crossref_primary_10_1016_j_ress_2025_110948 crossref_primary_10_1016_j_cor_2012_02_002 crossref_primary_10_1016_j_ejor_2015_01_008 crossref_primary_10_1016_j_amc_2010_01_106 crossref_primary_10_1243_1748006XJRR51 crossref_primary_10_1007_s40430_019_1792_x crossref_primary_10_1016_j_simpat_2013_12_013 crossref_primary_10_1007_s10732_014_9265_y crossref_primary_10_1007_s11771_009_0080_9 crossref_primary_10_1016_j_eswa_2008_12_024 crossref_primary_10_1016_j_ress_2019_106694 crossref_primary_10_1016_j_aei_2025_103163 crossref_primary_10_1002_qre_3243 crossref_primary_10_1080_0740817X_2016_1189631 crossref_primary_10_1007_s11431_013_5372_5 crossref_primary_10_1016_j_ejor_2021_06_033 crossref_primary_10_1016_j_ress_2020_106987 crossref_primary_10_1016_j_ress_2006_04_006 crossref_primary_10_1016_j_ins_2014_07_055 crossref_primary_10_1016_j_amc_2011_06_012 crossref_primary_10_1016_j_ress_2022_108843 crossref_primary_10_1109_TSMCA_2006_889476 crossref_primary_10_1016_j_ress_2023_109317 crossref_primary_10_1016_j_ress_2019_106629 crossref_primary_10_1016_j_ress_2022_108604 crossref_primary_10_1243_1748006XJRR191 crossref_primary_10_1016_j_ress_2018_12_010 crossref_primary_10_1016_j_ress_2022_108564 crossref_primary_10_1109_TR_2005_859227 crossref_primary_10_1007_s11227_025_07708_7 crossref_primary_10_1177_1748006X18809498 crossref_primary_10_1016_j_ress_2018_09_005 crossref_primary_10_1109_TR_2010_2055927
Cites_doi	10.1287/ijoc.12.1.2.11900 10.1016/0167-6377(92)90008-Q 10.1109/24.877336 10.1109/5.915372 10.1007/s10107-003-0467-6 10.1109/5.705525 10.1109/24.914551 10.1109/TR.1978.5220403 10.1109/TR.1978.5220232 10.1109/5.915380 10.1126/science.280.5370.1716 10.1109/24.75341 10.1023/A:1011962605464 10.1109/24.273585 10.1023/A:1008321216723
ContentType	Journal Article
Copyright	2004 Elsevier B.V. 2006 INIST-CNRS Copyright Elsevier Sequoia S.A. May 16, 2006
Copyright_xml	– notice: 2004 Elsevier B.V. – notice: 2006 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. May 16, 2006
DBID	AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
DOI	10.1016/j.ejor.2004.06.006
DatabaseName	CrossRef Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1872-6860
EndPage	38
ExternalDocumentID	934412361 eeeejores_v_3a171_3ay_3a2006_3ai_3a1_3ap_3a24_38_htm 17507354 10_1016_j_ejor_2004_06_006 S0377221704004369
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c423t-6a4c4322fffc08cf9c1d507af1c974bb3b8b55ac244da58a2c92b9e8a377bbf73
ISICitedReferencesCount	84
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000233958300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0377-2217
IngestDate	Sun Nov 30 05:10:00 EST 2025 Wed Aug 18 03:50:57 EDT 2021 Mon Jul 21 09:13:02 EDT 2025 Sat Nov 29 01:40:42 EST 2025 Tue Nov 18 22:14:39 EST 2025 Fri Feb 23 02:32:17 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Integer programming Branch-and-bound Reliability Redundancy allocation Monotonic function Coherent system Separability Non convex programming Branch and bound method Redundancy Non linear programming System reliability Optimization Optimal allocation Objective function
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c423t-6a4c4322fffc08cf9c1d507af1c974bb3b8b55ac244da58a2c92b9e8a377bbf73
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	204184280
PQPubID	45678
PageCount	15
ParticipantIDs	proquest_journals_204184280 repec_primary_eeeejores_v_3a171_3ay_3a2006_3ai_3a1_3ap_3a24_38_htm pascalfrancis_primary_17507354 crossref_primary_10_1016_j_ejor_2004_06_006 crossref_citationtrail_10_1016_j_ejor_2004_06_006 elsevier_sciencedirect_doi_10_1016_j_ejor_2004_06_006
PublicationCentury	2000
PublicationDate	2006-05-16
PublicationDateYYYYMMDD	2006-05-16
PublicationDate_xml	– month: 05 year: 2006 text: 2006-05-16 day: 16
PublicationDecade	2000
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationSeriesTitle	European Journal of Operational Research
PublicationTitle	European journal of operational research
PublicationYear	2006
Publisher	Elsevier B.V Elsevier Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A
References	Kuo, Zuo (bib12) 2002 Kim, Yum (bib8) 1993; 42 Doering, Nishi (bib3) 2001; 89 Keyes (bib7) 2001; 89 Gopal, Aggarwal, Gupta (bib4) 1978; 29 Prasad, Kuo (bib17) 2000; 49 Kuo, Prasad (bib10) 2000; 49 Lee, Mitchell (bib13) 2001 Tuy, Luc (bib20) 2000; 18 Heath, Kuekes, Snider, Williams (bib5) 1998; 280 Chern (bib2) 1992; 11 Koren, Koren (bib9) 1998; 86 Kuo, Prasad, Tillman, Hwang (bib11) 2001 Barlow, Proschan (bib1) 1996 Tawarmalani, Sahinidis (bib19) 2004; 99 Nakagawa, Nakashima, Hattri (bib15) 1978; 27 Sun, Mckinnon, Li (bib18) 2001; 21 Nemhauser, Wolsey (bib16) 1988 Johnson, Nemhauser, Savelsbergh (bib6) 2000; 12 Misra, Sharma (bib14) 1991; 40 Misra (10.1016/j.ejor.2004.06.006_bib14) 1991; 40 Sun (10.1016/j.ejor.2004.06.006_bib18) 2001; 21 Kuo (10.1016/j.ejor.2004.06.006_bib12) 2002 Tawarmalani (10.1016/j.ejor.2004.06.006_bib19) 2004; 99 Tuy (10.1016/j.ejor.2004.06.006_bib20) 2000; 18 Doering (10.1016/j.ejor.2004.06.006_bib3) 2001; 89 Koren (10.1016/j.ejor.2004.06.006_bib9) 1998; 86 Kim (10.1016/j.ejor.2004.06.006_bib8) 1993; 42 Nakagawa (10.1016/j.ejor.2004.06.006_bib15) 1978; 27 Chern (10.1016/j.ejor.2004.06.006_bib2) 1992; 11 Nemhauser (10.1016/j.ejor.2004.06.006_bib16) 1988 Johnson (10.1016/j.ejor.2004.06.006_bib6) 2000; 12 Keyes (10.1016/j.ejor.2004.06.006_bib7) 2001; 89 Barlow (10.1016/j.ejor.2004.06.006_bib1) 1996 Kuo (10.1016/j.ejor.2004.06.006_bib10) 2000; 49 Lee (10.1016/j.ejor.2004.06.006_bib13) 2001 Gopal (10.1016/j.ejor.2004.06.006_bib4) 1978; 29 Heath (10.1016/j.ejor.2004.06.006_bib5) 1998; 280 Kuo (10.1016/j.ejor.2004.06.006_bib11) 2001 Prasad (10.1016/j.ejor.2004.06.006_bib17) 2000; 49
References_xml	– volume: 86 start-page: 1819 year: 1998 end-page: 1837 ident: bib9 article-title: Defect tolerance in vlsi circuits: techniques and yield analysis publication-title: Proceedings of the IEEE – volume: 49 start-page: 323 year: 2000 end-page: 330 ident: bib17 article-title: Reliability optimization of coherent system publication-title: IEEE Transactions on Reliability – volume: 99 start-page: 563 year: 2004 end-page: 591 ident: bib19 article-title: Global optimization of mixed integer nonlinear programs: A theoretical and computational study publication-title: Mathematical Programming – volume: 18 start-page: 1 year: 2000 end-page: 15 ident: bib20 article-title: A new approach to optimization under monotonic constraint publication-title: Journal of Global Optimization – volume: 89 start-page: 227 year: 2001 end-page: 239 ident: bib7 article-title: Fundamental limits of silicon technology publication-title: Proceedings of the IEEE – year: 2002 ident: bib12 article-title: Optimal Reliability Modeling: Principles and Applications – volume: 27 start-page: 31 year: 1978 end-page: 38 ident: bib15 article-title: Optimal reliability allocation by branch-and-bound technique publication-title: IEEE Transactions on Reliability – volume: 29 start-page: 325 year: 1978 end-page: 328 ident: bib4 article-title: An improved algorithm for reliability optimization publication-title: IEEE Transactions on Reliability – volume: 12 start-page: 2 year: 2000 end-page: 23 ident: bib6 article-title: Progress in linear programming-based algorithms for integer programming: an exposition publication-title: INFORMS Journal on Computing – volume: 42 start-page: 572 year: 1993 end-page: 578 ident: bib8 article-title: A heuristic method for solving redundancy optimization problems in complex systems publication-title: IEEE Transactions on Reliability – volume: 40 start-page: 81 year: 1991 end-page: 91 ident: bib14 article-title: An efficient algorithm to solve integer-programming problems arising in system reliability design publication-title: IEEE Transactions on Reliability – volume: 11 start-page: 309 year: 1992 end-page: 315 ident: bib2 article-title: On the computational complexity of reliability redundancy allocation in a series system publication-title: Operations Research Letters – volume: 280 start-page: 1716 year: 1998 end-page: 1721 ident: bib5 article-title: A defect-tolerant computer architecture: opportunities for nanotechnology publication-title: Science – volume: 21 start-page: 185 year: 2001 end-page: 199 ident: bib18 article-title: A convexification method for a class of global optimization problems with applications to reliability optimization publication-title: Journal of Global Optimization – year: 1996 ident: bib1 article-title: Mathematical Theory of Reliability – year: 2001 ident: bib13 article-title: Encyclopedia of Optimization, vol. 2, Chapter Integer Programming: Branch and Bound Methods – volume: 89 start-page: 375 year: 2001 end-page: 393 ident: bib3 article-title: Limits of integrated-circuit manufacturing publication-title: Proceedings of the IEEE – year: 1988 ident: bib16 article-title: Integer and Combinatorial Optimization – year: 2001 ident: bib11 article-title: Optimal Reliability Design: Fundamentals and Applications – volume: 49 start-page: 176 year: 2000 end-page: 191 ident: bib10 article-title: An annotated overview of system reliability optimization publication-title: IEEE Transactions on Reliability – volume: 12 start-page: 2 issue: 1 year: 2000 ident: 10.1016/j.ejor.2004.06.006_bib6 article-title: Progress in linear programming-based algorithms for integer programming: an exposition publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.12.1.2.11900 – volume: 11 start-page: 309 issue: 5 year: 1992 ident: 10.1016/j.ejor.2004.06.006_bib2 article-title: On the computational complexity of reliability redundancy allocation in a series system publication-title: Operations Research Letters doi: 10.1016/0167-6377(92)90008-Q – volume: 49 start-page: 176 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.06.006_bib10 article-title: An annotated overview of system reliability optimization publication-title: IEEE Transactions on Reliability doi: 10.1109/24.877336 – volume: 89 start-page: 227 issue: 3 year: 2001 ident: 10.1016/j.ejor.2004.06.006_bib7 article-title: Fundamental limits of silicon technology publication-title: Proceedings of the IEEE doi: 10.1109/5.915372 – volume: 99 start-page: 563 issue: 3 year: 2004 ident: 10.1016/j.ejor.2004.06.006_bib19 article-title: Global optimization of mixed integer nonlinear programs: A theoretical and computational study publication-title: Mathematical Programming doi: 10.1007/s10107-003-0467-6 – volume: 86 start-page: 1819 issue: 9 year: 1998 ident: 10.1016/j.ejor.2004.06.006_bib9 article-title: Defect tolerance in vlsi circuits: techniques and yield analysis publication-title: Proceedings of the IEEE doi: 10.1109/5.705525 – volume: 49 start-page: 323 issue: 3 year: 2000 ident: 10.1016/j.ejor.2004.06.006_bib17 article-title: Reliability optimization of coherent system publication-title: IEEE Transactions on Reliability doi: 10.1109/24.914551 – volume: 29 start-page: 325 year: 1978 ident: 10.1016/j.ejor.2004.06.006_bib4 article-title: An improved algorithm for reliability optimization publication-title: IEEE Transactions on Reliability doi: 10.1109/TR.1978.5220403 – year: 2002 ident: 10.1016/j.ejor.2004.06.006_bib12 – volume: 27 start-page: 31 issue: l year: 1978 ident: 10.1016/j.ejor.2004.06.006_bib15 article-title: Optimal reliability allocation by branch-and-bound technique publication-title: IEEE Transactions on Reliability doi: 10.1109/TR.1978.5220232 – year: 1988 ident: 10.1016/j.ejor.2004.06.006_bib16 – year: 2001 ident: 10.1016/j.ejor.2004.06.006_bib11 – year: 2001 ident: 10.1016/j.ejor.2004.06.006_bib13 – volume: 89 start-page: 375 issue: 3 year: 2001 ident: 10.1016/j.ejor.2004.06.006_bib3 article-title: Limits of integrated-circuit manufacturing publication-title: Proceedings of the IEEE doi: 10.1109/5.915380 – volume: 280 start-page: 1716 year: 1998 ident: 10.1016/j.ejor.2004.06.006_bib5 article-title: A defect-tolerant computer architecture: opportunities for nanotechnology publication-title: Science doi: 10.1126/science.280.5370.1716 – volume: 40 start-page: 81 issue: 1 year: 1991 ident: 10.1016/j.ejor.2004.06.006_bib14 article-title: An efficient algorithm to solve integer-programming problems arising in system reliability design publication-title: IEEE Transactions on Reliability doi: 10.1109/24.75341 – volume: 21 start-page: 185 year: 2001 ident: 10.1016/j.ejor.2004.06.006_bib18 article-title: A convexification method for a class of global optimization problems with applications to reliability optimization publication-title: Journal of Global Optimization doi: 10.1023/A:1011962605464 – volume: 42 start-page: 572 issue: 4 year: 1993 ident: 10.1016/j.ejor.2004.06.006_bib8 article-title: A heuristic method for solving redundancy optimization problems in complex systems publication-title: IEEE Transactions on Reliability doi: 10.1109/24.273585 – year: 1996 ident: 10.1016/j.ejor.2004.06.006_bib1 – volume: 18 start-page: 1 year: 2000 ident: 10.1016/j.ejor.2004.06.006_bib20 article-title: A new approach to optimization under monotonic constraint publication-title: Journal of Global Optimization doi: 10.1023/A:1008321216723
SSID	ssj0001515
Score	2.1943877
Snippet	The redundancy allocation problem, which seeks to find the optimal allocation of redundancy that maximizes system reliability, is one of the representative...
SourceID	proquest repec pascalfrancis crossref elsevier
SourceType	Aggregation Database Index Database Enrichment Source Publisher
StartPage	24
SubjectTerms	Allocations Applied sciences Branch & bound algorithms Branch-and-bound Exact sciences and technology Integer programming Mathematical programming Operational research and scientific management Operational research. Management science Operations research Optimization Redundancy Redundancy allocation Reliability Reliability theory. Replacement problems Studies
Title	Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems
URI	https://dx.doi.org/10.1016/j.ejor.2004.06.006 http://econpapers.repec.org/article/eeeejores/v_3a171_3ay_3a2006_3ai_3a1_3ap_3a24-38.htm https://www.proquest.com/docview/204184280
Volume	171
WOSCitedRecordID	wos000233958300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKixAIcRkgymDyA29VpjZxGoe3gobGRQOhAX2zbMeGVV1aJV3V_U1-Ecexk7hDmwBBpVxkJU6T8-X488m5IPRccZ3qKJXBkI9pQDLNA8ElDSJKIypFImUVx_3lfXJ0RKfT9GOn86OOhVnPkzynm026_K-ihjYQtgmd_QNxN51CA-yD0GENYof1bwneOBnb5Nvng0KZIDGjQAfmA3vryjHJTXxksVgrE73C5y4as3I6zBd55Yu-MXuGhZps2NaN69TGrlc1aMpLjfqO4EJDUZsaXU6hxvb87qwy0X5tXXgOuf36D8oHFqvsTBLmsu3bI88fvL4_-X17Bow4sPGV1qrmKICn-KIkCcLQxnTuK6uYaRIGY2prDzSa21Zv2YKo08PEG9Ft-phfxgprtpjtq9miSgxLqkSuwwuJuauhXsEPjlIlW7OIw2VhfQ6LuR3YnJhGWJamibCIsu-r02uoFyZxSruoN3lzMH3b8ANDIatvW-4uXSiX9Tq8-Gcuo0u3l7yEl1jb6itb06NeoZZKeizp-B664ySEJxaW91FH5TvoRh1dsYPu1lVEsBtUdtAtLyXmA_TNgy9u4Ytb-L7AkxzX4MUeeDGAFzfgxQ14sQdeXIP3Ifr8-uD41WHgioEEEhj_KhhzIgmMPlprOaRSp3KUwVyG65GEKbEQkaAijrkEuprxmPJQpqFIFeXwmIXQSfQIdeHC6jHCSlMxFiZFO40IzUQKcwQOXDcbhmmmiOyjUf3MmXSZ8k3BljmrXSJnzMjJlHAlrPILHffRoDlnafPEXHl0XIuSOaZrGSwDcF553t6W3NtLAfFPopj00W4NBOZe-BI6ICNKQjrso5cVNprT_gbXT_5FJ7voZqsKnqLuqjhTz9B1uV6dlMWee2N-Ato9CM8
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reliability+redundancy+allocation%3A+An+improved+realization+for+nonconvex+nonlinear+programming+problems&rft.jtitle=European+journal+of+operational+research&rft.au=Kuo%2C+Way&rft.au=Ha%2C+Chunghun&rft.series=European+Journal+of+Operational+Research&rft.date=2006-05-16&rft.pub=Elsevier&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=171&rft.issue=1&rft.spage=24&rft.epage=38&rft_id=info:doi/10.1016%2Fj.ejor.2004.06.006&rft.externalDocID=eeeejores_v_3a171_3ay_3a2006_3ai_3a1_3ap_3a24_38_htm
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon