System design is an NP-complete problem: Correspondence

  • Authors:

  • William L. Chapman;Jerzy Rozenblit;A. Terry Bahill

  • Affiliations:

  • Raytheon Missile Systems, Tucson, AZ 85739;Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721;Systems and Industrial Engineering, University of Arizona, 1130 E. North Campus Drive, Tucson, AZ 85721-0020

  • Venue:
  • Systems Engineering
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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. © 2001 John Wiley & Sons, Inc. Syst Eng 4: 222–229, 2001