|
1. |
A linear programming model for design of communications networks with time varying probabilistic demands |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 1-32
K. O. Kortanek,
D. N. Lee,
G. G. Polak,
Preview
|
PDF (1626KB)
|
|
摘要:
AbstractIn this paper marginal investment costs are assumed known for two kinds of equipment stocks employed to supply telecommunications services: trunks and switching facilities. A network hierarchy is defined which includes important cases occurring in the field and also appearing in the literature. A different use of the classical concept of the marginal capacity of an additional trunk at prescribed blocking probability leads to a linear programming supply model which can be used to compute the sizes of all the high usage trunk groups. The sizes of the remaining trunk groups are approximated by the linear programming models, but can be determined more accurately by alternate methods once all high usage group sizes are computed. The approach applies to larger scale networks than previously reported in the literature and permits direct application of the duality theory of linear programming and its sensitivity analyses to the study and design of switched probabilistic communications networks with multiple busy hours during the day. Numerical results are presented for two examples based on field data, one of which having been designed by the multi‐hour engineering metho
ISSN:0028-1441
DOI:10.1002/nav.3800280102
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
2. |
Preventive maintenance and replacement under additive damage |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 33-46
S. D. Chikte,
S. D. Deshmukh,
Preview
|
PDF (811KB)
|
|
摘要:
AbstractA system deteriorates due to shocks received at random times, each shock causing a random amount of damage which accumulates over time and may result in a system failure. Replacement of a failed system is mandatory, while an operable one may also be replaced. In addition, the shock process causing system deterioration may be controlled by continuous preventive maintenance expenditures. The joint problem of optimal maintenance and replacement is analyzed and it is shown that, under reasonable conditions, optimal maintenance rate is decreasing in the cumulative damage level and that beyond a certain critical level the system should be replaced. Meaningful bounds are established on the optimal policies and an illustrative example is provided.
ISSN:0028-1441
DOI:10.1002/nav.3800280103
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
3. |
Optimal maintenance models for systems subject to failure–A Review |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 47-74
Y. S. Sherif,
M. L. Smith,
Preview
|
PDF (1994KB)
|
|
摘要:
AbstractThis paper is a state‐of‐the‐art review of the literature related to optimal maintenance models of systems subject to failure. The emphasis is on work appearing since the 1976 survey, “A Survey of Maintenance Models: The Control and Surveillance of Deteriorating Systems,” by W.P. Pierskalla and J.A. Voelker, published in thi
ISSN:0028-1441
DOI:10.1002/nav.3800280104
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
4. |
Bounds for strength‐stress interference via mathematical programming |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 75-81
Geung‐Ho Kim,
Preview
|
PDF (413KB)
|
|
摘要:
AbstractProblems of bounding Pr {X>Y}, when the distribution ofXis subject to certain moment conditions and the distribution ofYis known to be of convexconcave type, are treated in the framework of mathematical programming. Juxtaposed are two programming methods; one is based on the notion of weak duality and the other on the geometry of a certain moment space.
ISSN:0028-1441
DOI:10.1002/nav.3800280105
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
5. |
Bounds and elimination in generalized markov decisions |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 83-92
Gary J. Koehler,
Preview
|
PDF (413KB)
|
|
摘要:
AbstractIn discounted Markov decision processes bounds on the optimal value function can be computed and used to eliminate suboptimal actions. In this paper we extend these procedures to the generalized Markov decision process. In so doing we forfeit the contraction property and must base our analysis on other procedures. Duality theory and the Perron‐Frobenius theorem are the main tool
ISSN:0028-1441
DOI:10.1002/nav.3800280106
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
6. |
Surrogate duality in a branch‐and‐bound procedure |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 93-101
Mark H. Karwan,
Ronald L. Rardin,
Preview
|
PDF (482KB)
|
|
摘要:
AbstractRecent research has led to several surrogate multiplier search procedures for use in a primal branch‐and‐bound procedure. As single constrained integer programming problems, the surrogate subproblems are also solved via branch‐and‐bound. This paper develops the inner play between the surrogate subproblem and the primal branch‐and‐bound trees which can be exploited to produce a number of computational efficiencies. Most important is a restarting procedure which precludes the need to solve numerous surrogate subproblems at each node of a primal branch‐and‐bound tree. Empirical evidence suggests that this procedure greatly reduces total c
ISSN:0028-1441
DOI:10.1002/nav.3800280107
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
7. |
Extreme solutions of the two machine flow‐shop problem |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 103-114
Wlodzimierz Szwarc,
Preview
|
PDF (464KB)
|
|
摘要:
AbstractThe paper provides a new theoretical framework to identify extreme solutions of the two machine flow‐shop problem. Some remarkable properties of these solutions have been developed. As a result the problem of generating minimal solutions can be decomposed into a number of smaller subproblem
ISSN:0028-1441
DOI:10.1002/nav.3800280108
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
8. |
A theoretical and computational comparison of “equivalent” mixed‐integer formulations |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 115-131
R. R. Meyer,
Preview
|
PDF (822KB)
|
|
摘要:
AbstractThis paper provides a theoretical and computational comparison of alternative mixed integer programming formulations for optimization problems involving certain types of economy‐of‐scale functions. Such functions arise in a broad range of applications from such diverse areas as vendor selection and communications network design. A “nonstandard” problem formulation is shown to be superior in several respects to the traditional formulation of problems in thi
ISSN:0028-1441
DOI:10.1002/nav.3800280109
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
9. |
Stochastic models for spread of motivating information |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 133-145
Menachem Berg,
Preview
|
PDF (589KB)
|
|
摘要:
AbstractIn this work we consider spread of information which motivates the hearer to perform some specified action. The time to completion of an action is assumed to be a random variable and the main focus is on the number of completed actions by timet, X(t). Some models, which reflect different degree of centralization in the spread process, are analyzed and the distribution ofX(t), as well as that of some other stochastic processes of interest, are obtained. The relevance to propagation of epidemics is pointed out.All models are solved by employing two interrelated concepts, namely, the order statistics property of stochastic processes and the binomial closure property of collections of distributions. In this respect, the work also serves as an illustration of the application of these useful concepts.
ISSN:0028-1441
DOI:10.1002/nav.3800280110
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
10. |
Maximal nash subsets for bimatrix games |
|
Naval Research Logistics Quarterly,
Volume 28,
Issue 1,
1981,
Page 147-152
M. J. M. Jansen,
Preview
|
PDF (350KB)
|
|
摘要:
AbstractIn this work maximal Nash subsets are studied in order to show that the set of equilibrium points of a bimatrix game is the finite union of all such subsets. In addition, the extreme points of maximal Nash subsets are characterized in terms of square submatrices of the payoff matrices and dimension relations are derived.
ISSN:0028-1441
DOI:10.1002/nav.3800280111
出版商:Wiley Subscription Services, Inc., A Wiley Company
年代:1981
数据来源: WILEY
|
|