Minimax design of two‐state k‐out‐of‐n systems
Vassilis S. Kouikoglou, Yannis A. Phillis
Abstract
Vassilis S. Kouikoglou, Yannis A. Phillis
Abstract
Abstract The optimal size of k is specified for two‐state k‐out‐of‐n systems that may be functioning or fail in either state. It is assumed that the steady‐state, success and failure probabilities are not known exactly. The problem is reduced to finding the saddle‐point solution to a minimax optimization problem. An example shows that the minimax design is robust with regard to uncertainty.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract The optimal size of k is specified for two‐state k‐out‐of‐n systems that may be functioning or fail in either state. It is assumed that the steady‐state, success and failure probabilities are not known exactly. The problem is reduced to finding the saddle‐point solution to a minimax optimization problem. An example shows that the minimax design is robust with regard to uncertainty.
Key concepts: Minimax, Saddle point, Mathematics, State (computer science), Mathematical optimization, Saddle, Applied mathematics, Combinatorics