The scheme complexity of discrete optimization

The scheme complexity of discrete optimization -- We consider an approach to the problem of minimization of a linear form (a, x) over £ M C 5J, where a G Rn is an input vector, M = N/ = {: f ( x ) = 1), f ( x ) is a characteristic function of fc-valued logic. To estimate the complexity of search of the optimal point, we use the structure characteristic of the set /, which is equal to the complexity of the scheme description of this set by means of functional elements in suitable bases. The complexity of descriptive schemes describing N/ and such that they are associated by a natural way with optimization schemes of the same complexity is also used. It is shown that there are essential analogues with the problems of synthesis of computing schemes from functional elements including the applicability of analogues of methods of the theory of control system to discrete optimization. In many cases this approach gives polynomial algorithms, not always being the best. Sometimes we may obtain a polynomial algorithm by means of a preliminary processing of the input vector a. This article is an extended version of the author's lecture on DC All-Union Conference http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Mathematics and Applications de Gruyter

The scheme complexity of discrete optimization

Loading next page...
 
/lp/de-gruyter/the-scheme-complexity-of-discrete-optimization-JYTB8FJdvO
Publisher
de Gruyter
Copyright
Copyright © 2009 Walter de Gruyter
ISSN
0924-9265
eISSN
1569-3929
DOI
10.1515/dma.1993.3.2.127
Publisher site
See Article on Publisher Site

Abstract

-- We consider an approach to the problem of minimization of a linear form (a, x) over £ M C 5J, where a G Rn is an input vector, M = N/ = {: f ( x ) = 1), f ( x ) is a characteristic function of fc-valued logic. To estimate the complexity of search of the optimal point, we use the structure characteristic of the set /, which is equal to the complexity of the scheme description of this set by means of functional elements in suitable bases. The complexity of descriptive schemes describing N/ and such that they are associated by a natural way with optimization schemes of the same complexity is also used. It is shown that there are essential analogues with the problems of synthesis of computing schemes from functional elements including the applicability of analogues of methods of the theory of control system to discrete optimization. In many cases this approach gives polynomial algorithms, not always being the best. Sometimes we may obtain a polynomial algorithm by means of a preliminary processing of the input vector a. This article is an extended version of the author's lecture on DC All-Union Conference

Journal

Discrete Mathematics and Applicationsde Gruyter

Published: Jan 1, 1993

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off