1975
DOI: 10.1016/s1474-6670(17)67539-6
|View full text |Cite
|
Sign up to set email alerts
|

Optimization and Control Problems in Large-Scale Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

1977
1977
2014
2014

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…A suggestion that information value can better be characterized by a multi-component vector of attributes than by a scalar value arose in late 60-ths of the 20 th century (Kulikowski, 1969). In such case, the following problems arose: 1 st , what information (or data, as its particular form) attributes should be taken into account for its value characterization, 2 nd , what does it mean that a multi-aspect information value is "better" or "higher" than another one, 3 rd , how simple data multi-aspect values can be extended on higher-level data structures.…”
Section: A Historical View On the Dq Concepts' Developmentmentioning
confidence: 99%
“…A suggestion that information value can better be characterized by a multi-component vector of attributes than by a scalar value arose in late 60-ths of the 20 th century (Kulikowski, 1969). In such case, the following problems arose: 1 st , what information (or data, as its particular form) attributes should be taken into account for its value characterization, 2 nd , what does it mean that a multi-aspect information value is "better" or "higher" than another one, 3 rd , how simple data multi-aspect values can be extended on higher-level data structures.…”
Section: A Historical View On the Dq Concepts' Developmentmentioning
confidence: 99%
“…In this method the solution of Af is sought by maximizing the global objective function iteratively, first over the controls m, then over the inputs and outputs z and x3 then again over m and so on until convergence. This is essentially Geoffrion's (1970) method of projection, Mesarovic et al ' s (1970) method of model coordination and what Kulikowski, Krus, Manczak & Straszak (1975) and Wilson (1977) call parametric decomposition. To analyse the conditions under which the method will work it is necessary to describe it more formally which we may do as follows.…”
Section: (B) Primal Coordinationmentioning
confidence: 99%
“…It is quite possible for a subsystem to have more inputs and outputs than controls and thus if the inputs and outputs are arbitrarily fixed it is likely that there are no feasible values of m i which can achieve satisfaction of the local constraints (7). This is part of the reason for introducing the set V into CP but the simple definition of V given in ( 9) belies the fact that it is very difficult to compute this set at the coordinator level without centralizing all the local information (Findeisen 1974^), although some resolution of this difficulty is possible if all the functions T i and hi are linear (Kulikowski et a l . 1975 Another source of difficultyis that, in general, the gradient of the objective function ft(z, x) is not easy to compute and may not even exist: this is an important limitation because one itera tion of the coordinator problem requires solution of N problems P(i).…”
Section: (B) Primal Coordinationmentioning
confidence: 99%