System design is an NP-complete problem

William L. Chapman, Jerzy W Rozenblit, A. Terry Bahill

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

The system design process translates the customers' needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system's performance and cost goals. This paper proves that the System Design Problem is NP-complete by reduction from the Knapsack Problem, which is known to be NP-complete. The implication of this proof is that designing optimal systems with deterministic, polynomial time procedures is not possible. This is the primary reason why engineers do not try to produce optimal systems: They merely produce designs that are good enough.

Original languageEnglish (US)
Pages (from-to)222-229
Number of pages8
JournalSystems Engineering
Volume4
Issue number3
StatePublished - 2001

Fingerprint

Computational complexity
Optimal systems
Systems analysis
Polynomials
Engineers
Costs

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Chapman, W. L., Rozenblit, J. W., & Bahill, A. T. (2001). System design is an NP-complete problem. Systems Engineering, 4(3), 222-229.

System design is an NP-complete problem. / Chapman, William L.; Rozenblit, Jerzy W; Bahill, A. Terry.

In: Systems Engineering, Vol. 4, No. 3, 2001, p. 222-229.

Research output: Contribution to journalArticle

Chapman, WL, Rozenblit, JW & Bahill, AT 2001, 'System design is an NP-complete problem', Systems Engineering, vol. 4, no. 3, pp. 222-229.
Chapman, William L. ; Rozenblit, Jerzy W ; Bahill, A. Terry. / System design is an NP-complete problem. In: Systems Engineering. 2001 ; Vol. 4, No. 3. pp. 222-229.
@article{66b41c2cae6647959e663147f077fc91,
title = "System design is an NP-complete problem",
abstract = "The system design process translates the customers' needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system's performance and cost goals. This paper proves that the System Design Problem is NP-complete by reduction from the Knapsack Problem, which is known to be NP-complete. The implication of this proof is that designing optimal systems with deterministic, polynomial time procedures is not possible. This is the primary reason why engineers do not try to produce optimal systems: They merely produce designs that are good enough.",
author = "Chapman, {William L.} and Rozenblit, {Jerzy W} and Bahill, {A. Terry}",
year = "2001",
language = "English (US)",
volume = "4",
pages = "222--229",
journal = "Systems Engineering",
issn = "1098-1241",
publisher = "John Wiley and Sons Inc.",
number = "3",

}

TY - JOUR

T1 - System design is an NP-complete problem

AU - Chapman, William L.

AU - Rozenblit, Jerzy W

AU - Bahill, A. Terry

PY - 2001

Y1 - 2001

N2 - The system design process translates the customers' needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system's performance and cost goals. This paper proves that the System Design Problem is NP-complete by reduction from the Knapsack Problem, which is known to be NP-complete. The implication of this proof is that designing optimal systems with deterministic, polynomial time procedures is not possible. This is the primary reason why engineers do not try to produce optimal systems: They merely produce designs that are good enough.

AB - The system design process translates the customers' needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the top-level input and output requirements are tested to see how well they meet the system's performance and cost goals. This paper proves that the System Design Problem is NP-complete by reduction from the Knapsack Problem, which is known to be NP-complete. The implication of this proof is that designing optimal systems with deterministic, polynomial time procedures is not possible. This is the primary reason why engineers do not try to produce optimal systems: They merely produce designs that are good enough.

UR - http://www.scopus.com/inward/record.url?scp=1642295856&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1642295856&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:1642295856

VL - 4

SP - 222

EP - 229

JO - Systems Engineering

JF - Systems Engineering

SN - 1098-1241

IS - 3

ER -