11. |
Ranking assignments in order of increasing completion time |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 455-464
H.C. Bakhshi,
H.L. Bhatia,
M.C. Puri,
Preview
|
PDF (415KB)
|
|
摘要:
Bottleneck Assignment Problem has already been solved by Gross [5], Gar-Finkel [3] and Bhatia [1]. Starting with an assignment yielding minimum completion time, the present paper presents two procedures for ranking various assignments in order of increasing completion time. In the first, closed circuits satisfying certain conditions are found. Non-existence of such circuits at a particular time imply no assignment yielding that completion time. In the second procedure a cost minimizing assignment problem is solved to get an assignment yielding next best time, Murty's [8] cost ranking procedure has been suitably modified for time ranking and is discussed in a note in this paper.
ISSN:0323-3898
DOI:10.1080/02331938008842672
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
12. |
Dualität eines verallgemeinerten transport- nnd potentialproblems |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 465-472
M. Walk,
Preview
|
PDF (341KB)
|
|
摘要:
In this paper we present a generalization of the transportation and potential problem in finite directed graphs. The base for introduction of generalized transportation and potential problem is the idea of generalized flows and tensions with components in any linear spaces. Furthermore we represent for those problems the usual relations of theory of duality.
ISSN:0323-3898
DOI:10.1080/02331938008842673
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
13. |
Minimaxtheoreme für die diskrete gemischte erweiterung von spielen und ein approximationssatz1 |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 473-485
Jürgen Kindler,
Preview
|
PDF (603KB)
|
|
摘要:
Using a theorem of König [10] and a theorem proved earlier [7] minimax theorems for the discrete mixed extension of two-person zero-sum games are derived. It is shown that the problem of approximating a normed linear functional by an integral can be treated by game theoretic means. Finally, an example of such an approximation theorem is used for a simple proof of the Krein-Smulian and the Eberlein-Šmulian theorem.
ISSN:0323-3898
DOI:10.1080/02331938008842674
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
14. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 486-486
A. Korbut,
Preview
|
PDF (46KB)
|
|
摘要:
R. E. Burkard: Methoden der Ganzzahilgen Optimierung. Springer- Verlag, Wien- New York 1972, 292 S., DM 69,–69.
ISSN:0323-3898
DOI:10.1080/02331938008842675
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
15. |
Inequalities for the solutionsof nonlinear programming problemsdepending on a random parameter |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 487-497
Ebu Tamm,
Preview
|
PDF (421KB)
|
|
摘要:
This paper deals with nonlinear programming problems which depend on values of a random vector ξ. Problems without constraints and with equality constraints are handled.
ISSN:0323-3898
DOI:10.1080/02331938008842676
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
16. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 498-498
K.H. Elster,
Preview
|
PDF (76KB)
|
|
摘要:
J. T. Marti: Konvexe Analysis. Lehrbücher und Monographien der exakt. Wiss.: Mathemat. Reihe, Bd. 54. Birkhäuser Verlag Basel und Stuttgart, 1977, 273 S., SFr. 68.
ISSN:0323-3898
DOI:10.1080/02331938008842677
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
17. |
On a transient renewal function of dominated variation |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 499-505
M. Dewess,
Preview
|
PDF (250KB)
|
|
摘要:
We show that under a certain condition the renewal function of a transient renewal process varies dominatedly if and only if the interarrival times distribution varies dominatedly. This way the result of [1] is generalized.
ISSN:0323-3898
DOI:10.1080/02331938008842678
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
18. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 506-506
A. Hoffmann,
Preview
|
PDF (76KB)
|
|
摘要:
H. Späth (Hrsg.): Fallstudien Operations Research. Band 1, 2. R. Oldenbourg Verlag München- Wien 1978. Band 1: 47 Abb., Tab., 202 S. DM 39,–. Band 2: 47 Abb.,42 Tab 199 S. DM 39.
ISSN:0323-3898
DOI:10.1080/02331938008842679
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
19. |
Optimal resource allocation in a complex queueing system |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 507-512
P.K. Gupta,
Rakesh Kumar Verma,
Preview
|
PDF (245KB)
|
|
摘要:
This paper studies the optimal allocation of service rates in a three-stage complex queueing system with total finite waiting space. The word ‘optimal’ is being used in the seitse minimising sum of costs of servers and holding subject to relevant constraints. The problem has been solved through geometric programming.
ISSN:0323-3898
DOI:10.1080/02331938008842680
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|
20. |
Book review |
|
Mathematische Operationsforschung und Statistik. Series Optimization,
Volume 11,
Issue 3,
1980,
Page 513-516
M. Stiebitz,
Horst Saohs,
Preview
|
PDF (278KB)
|
|
摘要:
F. Harary: Graphentheorie. R. Oldenboung Verlag München- Wien 1974, 279 S., 145 Abb., 13 Tab., DM 60.
ISSN:0323-3898
DOI:10.1080/02331938008842681
出版商:Akademic-Verlag
年代:1980
数据来源: Taylor
|