摘要:

AbstractAn algorithm is given for solving minimum‐cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This provides a unified way of looking at many seemingly unrelated problems in different areas. In particular, it is shown how problems associated with electrical networks, with increasing the capacity of a network under a fixed budget, with Laplace equations, and with the Max‐Flow Min‐Cut Theorem may all be formulated into minimum‐cost flow problems in convex‐cost

ISSN:0028-1441    

DOI:10.1002/nav.3800130102

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

摘要:

AbstractAn inspector's game is a non‐constant‐sum two‐person game in which one player has promised to perform a certain duty and the other player is allowed to inspect and verify occasionally that the duty has indeed been performed.A solution to a variant of such a game is given in this paper, based on the assumption that the inspector can announce his mixed strategy in advance, if he so wishes, whereas the other player, who has already given his promise, cannot threaten by explicitly saying that he will not keep his

ISSN:0028-1441    

DOI:10.1002/nav.3800130103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800130104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

摘要:

AbstractThis paper discusses the one‐person economic survival game model with a discrete probability distribution for the contribution to surplus variable. The general game model and strategies in these games are examined, and necessary conditions which an undominated, stationary strategy must satisfy are obtained. For a special class of these games a mathematical formulation of the value of the game is given, and examples and theorems which relate to undominated strategies in this class are presented. This paper, in some sense, is a sequel to a portion of a paper by Shubik and Thompson [7] which appeared in this journa

ISSN:0028-1441    

DOI:10.1002/nav.3800130105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

摘要:

AbstractThis paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time‐cost tradeoff relationship might not hold generally are identified. When the time‐cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling

ISSN:0028-1441    

DOI:10.1002/nav.3800130106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

摘要:

AbstractIn this paper a component placement problem and a digital computer backboard wiring problem are formulated as integer linear programs. The component placement problem consists of making a unique assignment of components to column positions such that wireability is maximized. The backboard wiring problem consists of three interrelated subproblems, namely, the placement, the connection, and the routing problems. The placement and connection problems are combined and solved as one, thereby giving the optimal circuit connections as well as minimizing the total lead length. It is shown that under certain assumptions, the number of inequalities and variables in the problem can be greatly reduced. Further simplifying assumptions lead to a near optimal solution.Examples of other allocation problems to which the models presented here are applicable are given.The following concepts are formulated as linear inequalities: (1) the absolute magnitude of the difference between two variables; (2) minimize the minimum function of a set of functions; and (3) counting the number of (0, 1) adjacent component pairs in a vector.

ISSN:0028-1441    

DOI:10.1002/nav.3800130107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800130108

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800130109

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800130101

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1966

数据来源: WILEY