By Topic

Mathematical Programming Approaches to System Partitioning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Effective engineering of large systems requires a careful delineation of major areas of responsibility for design and development. Some important considerations are critical interdependencies in performing the system mission, major data flows within the system, and similarities in technology between different parts of the system. This partitioning activity is viewed in two stages: synthesis-derivation of a reasonably small number of candidate partitions- and evaluation-more thorough investigation of detailed trade-offs. Partition synthesis is addressed by means of mathematical programming. A series of formulations are given, ranging in complexity from a simple linear transportation problem to quadratic integer programs requiring maximization of a convex function. Selection among alternative formulations depends on the actual partitioning criteria applied as well as the degree of preselection desired from the synthesis.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:8 ,  Issue: 7 )