1. |
Die konstruktion lösbarer optimierungsprobleme |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 255-263
Horst Hollatz,
Preview
|
PDF (392KB)
|
|
摘要:
In this paper are constructed maximal regionsandfor a given (m, n)-matrix A, that the problem of linear programminghas an optimal solution for alland all.
ISSN:0047-6277
DOI:10.1080/02331887008801022
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
2. |
Ein erweiterungsprinzip als konzeption zur lösung kombinatorischer optimierungsprobleme |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 265-280
Manfred Schoch,
Preview
|
PDF (879KB)
|
|
摘要:
In the present paper the author develops a conception for solving combinatorial programming problems.There is used an extension principle resting upon the following basic idea: LetSbe the set of admissible solutions for the initial problem. Then one defines such a setRthatR∩Scontains a t least one optimal solution of the given problem. Using the elements of a sequence {bν} of real numbers one considers step by step subsetsUν ofRand for their elements it is inspected if they belong toSor not. The requirementsRandUν have to satisfy secure the existence of a setUϱ containing an optimal solution of the given problem. Such a solution surely will be known after finitely many steps by means of the optimality criterion formulated in the paper. Having founded in general the extension principle the author gives a procedure for solving the linear assignment problem and an algorithm for the travelling salesman problem both basing on the extension principle.
ISSN:0047-6277
DOI:10.1080/02331887008801023
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
3. |
The main principles for optimal allocation of capacities in network planning |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 281-288
Lev Ja Leifman,
Preview
|
PDF (493KB)
|
|
摘要:
The problem of allocating limited capacities among activities of the set of networks is studied. This allocation must be optimal in a certain sense (e.g. minimizing duration of projects involved) and subject to the usual constraints. Different approaches to the problem are considered: from the point of view of mathematical programming and that of dynamic programming. But the problem in its general case has no way to exact solution and is to be dealt with heuristic methods. Five main principles are formulated and explained which form the basis for these methods. Different algorithms are analysed in their relations to those principles. The author proposes to build a hierarchy of algorithms on the common basis of one system of standard procedures adjusted to the problem in question. The hierarchy is to be designed to solve more common cases of the problem with simpler means and to add to those moans more complicated rules for treating less common cases containing more rare elements.
ISSN:0047-6277
DOI:10.1080/02331887008801024
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
4. |
Sequentielle minimax-tests bei wiener-prozessen |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 289-295
Norbert Schmitz,
Preview
|
PDF (296KB)
|
|
摘要:
This paper deals with the construction of minimax tests for hypotheses concerning the mean of a WIENER process. An idea of De Groot; who considered a special kind of weight functions, is used to give a sufficient condition for that a minimax test can be chosen among the symmetrical sequential probability ratio tests. It is shown that this condition is satisfied for several classes of weight functions.
ISSN:0047-6277
DOI:10.1080/02331887008801025
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
5. |
Optimale wahl der abszissenwerte für die lineare regression bei gegebener kostenfunktion |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 297-308
Hans Bandemer,
Preview
|
PDF (476KB)
|
|
摘要:
The choice of the abscissa-values in linear regression is considered as a decision problem and it is treated in the present paper for the case that this choice is connected with given costs and that the risk is calculable by means of a given quadratic lossfunction. Three optimisation problems are formulated: i) minimal costs with bounded risk - ii) minima! risk with bounded costs - iii) minimal s u n of costs and risk. For these problems the existence of solutions is proved under assumptions concerning the cost function, assumptions being always satisfied in practice. For the first two problems alternative theorems are stated facilitating their treatment essentially.
ISSN:0047-6277
DOI:10.1080/02331887008801026
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
6. |
Große systeme und die lösung von extremalproblemen |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 309-326
V.S. Mihalevič,
Ju M. Ermolev,
V.V. Škurba,
N.Z. Šor,
Preview
|
PDF (1154KB)
|
|
ISSN:0047-6277
DOI:10.1080/02331887008801027
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
7. |
Rezension |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 327-328
H. Hollatz,
Preview
|
PDF (124KB)
|
|
摘要:
A. Jäger, K.Wenke: Lineare Wirtschaftsalgebra (Leitläden der angewandten Mathematik und Mechanik, Bd. 13) Verlag B. G. Teubner, Stuttgart 1969, X, 334 S., 45 Abb., 32 Tab., 136 Aufg., zahlr. Beisp., Ln.DM 48.
ISSN:0047-6277
DOI:10.1080/02331887008801028
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|
8. |
Bericht über die arbeitstagung ”mathematische optimierung“ |
|
Mathematische Operationsforschung und Statistik,
Volume 1,
Issue 4,
1970,
Page 329-331
H. Hollatz,
H. Weinert,
Preview
|
PDF (181KB)
|
|
摘要:
vom 3.5.–9.5. 1970 in Neuendorf/Hiddensee, DDR.
ISSN:0047-6277
DOI:10.1080/02331887008801029
出版商:Akademie-Verlag
年代:1970
数据来源: Taylor
|