Multi-Stage Optimization and Counting Optimal Elements

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we propose an optimization procedure (an algorithm A1 ), which for a given circuit without repetitions and cost function for this circuit, transforms the circuit into its subcircuit. For strictly increasing cost functions, the set of elements described by the subcircuit coincides with the set of optimal elements relative to the considered cost function. For increasing cost functions, the set of elements described by the subcircuit is a nonempty subset of the set of optimal elements.

Original languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Pages29-34
Number of pages6
DOIs
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
Volume331
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Systems Engineering
  • Automotive Engineering
  • Social Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Control and Optimization
  • Decision Sciences (miscellaneous)

Fingerprint

Dive into the research topics of 'Multi-Stage Optimization and Counting Optimal Elements'. Together they form a unique fingerprint.

Cite this