<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

The optimal consecutive-k-out-of-n : G line for n <= 2k

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

DOI

10.1016/j.jspi.2003.09.018

Abstract

Two proofs for the problem in the title have been published but both are incomplete. In this note we observe the subtle errors in these proofs and give a new proof by a different approach. (C) 2003 Elsevier B.V. All rights reserved.

Description

Citation

Endorsement

Review

Supplemented By

Referenced By