1. |
Duale uneigentliche lineare und konvexe optimierungsprobleme |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 167-178
I.I. Erjomin,
Preview
|
PDF (648KB)
|
|
摘要:
Problems of mathematical programming are designed as “improper” if the primal and dual problem are not common solvable. This problem is the subject of an essential theory being different from the usual theory of “proper” problems. This paper is based on the duality theory.
ISSN:0323-3898
DOI:10.1080/02331938208842776
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
2. |
Subdifferential representation of implicitly defined functions |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 179-186
Bernd Luderer,
Preview
|
PDF (365KB)
|
|
摘要:
Subdifferential representations are presented for some implicitly defined functions occurring in the development of decomposition methods for solving structured problems of convex programming and optimal control.
ISSN:0323-3898
DOI:10.1080/02331938208842777
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
3. |
Goal-programming mitLp-metriken |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 187-200
Wolfgang Stadje,
Preview
|
PDF (691KB)
|
|
摘要:
The usual goal programming approach is generalized to the case, where the set of “alternatives” is a closed, convex set of functions on a compact setKand theLp-metric is used. The main results concern the continuity and monotonicity ofand of the minimizing functions. They are new even in the case. For finiteKthe convergence offp, asp→ ∞, is proved. IfK= {1, 2}, it is seen thatandare monotone, whereas an example withK= {1, 2, 3} shows that these properties cannot be generalized.
ISSN:0323-3898
DOI:10.1080/02331938208842778
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
4. |
Eine explizite darstellimg der menge der optimallösungen eines linearen optimierungsproblems |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 201-209
Manfred Stefek,
Preview
|
PDF (360KB)
|
|
摘要:
In a linear optimization problem there are generally variables being Zero for each optimal solution. A method for the determination of these variables is given. By means of these variables it is possible to calculate a separate basic representation for those variables which can take positive values in the set of optimal solutions. Hence the dimension of this set follows directly.
ISSN:0323-3898
DOI:10.1080/02331938208842779
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
5. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 210-210
R. Lorentz,
Preview
|
PDF (58KB)
|
|
摘要:
Bröcker, T.: Analysis in mehren Variablen einschließlich gewöhnlier Differentialgleichungen und des Satzes von Stokes. Teubner Studienbücher, B.G. Teubner Stuttgart 1980. VI+361 S., 114 Fig., DM 29.80.
ISSN:0323-3898
DOI:10.1080/02331938208842780
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
6. |
Über ein yerfahren zur lösung rein-ganzzahliger nichtlinearer optimierungsprobleme |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 211-220
Klaus Hofstedt,
Preview
|
PDF (372KB)
|
|
摘要:
This paper presents a method for the solution of nonlinear integer optimization problems with a linear objective function and a bounded feasible region. The algorithm applies the principle of bundling to a linear auxiliary problem using so-called foundational knapsack bundles. A concluding example shall illustrate the algorithm, and some numerical results are given.
ISSN:0323-3898
DOI:10.1080/02331938208842781
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
7. |
Untersuchungen über eine günstige verzweigungsreihenfolge der variablen bei branch and bound-verfahren |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 221-229
Frank Körner,
Preview
|
PDF (393KB)
|
|
摘要:
A branch and bound algorithm for the nonlinear integer programming problem is investigated. A condition in which order the variables should be ramified to make the number of knots being studied to a minimum is given. The results obtained are discussed for the knapsack problem.
ISSN:0323-3898
DOI:10.1080/02331938208842782
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
8. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 230-230
R. Deumlich,
Preview
|
PDF (48KB)
|
|
摘要:
Gross, H.: Quadratic Forms in Infinite Dimensional Vector Spaces. Birkhäuser Verlag Basel, Boston, Stuttgart 1979, 431 S., DM 42.–.
ISSN:0323-3898
DOI:10.1080/02331938208842783
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
9. |
A new extension principle algorithm for the traveling salesman problem |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 231-245
Guntram Scheithauer,
Johannes Terno,
Preview
|
PDF (767KB)
|
|
摘要:
In this paper, an algorithm for solving the asymmetric traveling salesman problem is developed and tested by computation. This algorithm is based on the extension principle by Schoch and uses the assignment problem relaxation of the traveling salesman problem for computing lower bounds. Computational experience with randomly generated test problems indicate that the present algorithm yields good results in runtime which are comparable with the results of Smith/Srinivasan/Thompson. Computational experience are reported for up to 120-node problems with uniformly distributed and approximately normally distributed cost.
ISSN:0323-3898
DOI:10.1080/02331938208842784
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|
10. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 13,
Issue 2,
1982,
Page 246-246
B. Schwartz,
Preview
|
PDF (50KB)
|
|
摘要:
H.R.Schwartz: Methode der finiten Elemente. Teubner Studienbücher Mathematik. B.G. Teubner Stuttgart 1980, 320 S., DM 29.80.
ISSN:0323-3898
DOI:10.1080/02331938208842785
出版商:Akademic-Verlag
年代:1982
数据来源: Taylor
|