OPTIMAL RELIABILITY ALLOCATION BY BRANCH-AND-BOUND TECHNIQUE

被引：21

作者：

NAKAGAWA, Y

NAKASHIMA, K

HATTORI, Y

机构：

[1] KYOTO UNIV,INST ATOM ENERGY,KYOTO 606,JAPAN

[2] HIMEJI INST TECHNOL,DEPT ELECTR ENGN,2167 SHOSHA,HIMEJI,HIMEJI 67122,JAPAN

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1978年 / 27卷 / 01期

关键词：

Branch-and-bound; Optimal reliability allocation; separation and relaxation;

D O I：

10.1109/TR.1978.5220232

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The paper presents an efficient method for finding the exact optimal solutions of reliability allocation problems that are formulated as an integer nonlinear programming problem generalized to handle nonlinear constraints and nonseparable problems. The method is based on branch-and-bound and developed by considering separation and relaxation techniques. © 1978 IEEE

引用

页码：31 / 38

页数：8

共 24 条

[1] OPTIMAL REDUNDANCY ALLOCATION FOR NON SERIES-PARALLEL NETWORKS [J].