摘要:

The point of departure of this paper is the planning and scheduling of a project by using the critical path method for a block diagram. The network is represented as a graph, and the task of scheduling the time is formulatod as a potential problem. Considering available resource levels in realizing a project, the graph is extended and several constraints are formed for a flow in the extended graph. These constraints and the potential problem lead to an integer linear programming problem with the object of minimizing the time. Finally, by using an example the structure of the linear programming problem is displayed and an algorithm for solving the problem is mentioned.

ISSN:0047-6277    

DOI:10.1080/02331887208801080

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

The solution of the shortest path problem in case of time-independent edge-lengths is due to FORD and FULKERSON [1,2]. By using the method of dynamic programming, BELLMAN [3] gave a procedure for the determination of the length of the shortest path. Following this principle COOKE and HALSEY [4] have a procedure for the determination of the length of the shortest path in case of time-dependent edge-lengths. This procedure, however, gives only the length of the path, not the path itself. We shall demonstrate in this paper that the method of FORD and FULKERSON leads itself too to solution of the problem, morcover it gives also the shortest path.

ISSN:0047-6277    

DOI:10.1080/02331887208801081

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

With the help of the NEYMAN-PEARSON lemma there are given general assertions about the form of the solutions of the minimax problem (3), (4), (5) with the restrictions (A), (B1), (B2) and the additional assumptions (C), (D). If the additional assumption (E) is fulfilled, too, the solutions can be calculated by means of the VOLTERA integral equations (34), (35). In part II of the paper a class of optimal control problems will be solved by this method.

ISSN:0047-6277    

DOI:10.1080/02331887208801082

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

The size of the confidence bands for linear regression functions proposed in the literature is random. In this paper we construct confidence bands, whose size (width, content etc.) over a certain range for the regressor does not exceed a given value. We solve this problem by generalization of the known STEIN idea of two-stage confidence intervals. We propose two different two-stage procedures. The first procedure is based on anF-distribution and the margins of the bands are “surfaces of second order”. The second procedure is based on a multidimensionalt-distribution and the margins are “hyperplanes”. We explain connections with problems of optimal design and with applications of linear and nonlinear programming considering estimated coefficients.

ISSN:0047-6277    

DOI:10.1080/02331887208801083

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

This paper is a revue of recent works on optimal regression designs containing some new results.

ISSN:0047-6277    

DOI:10.1080/02331887208801084

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

I. singer: Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces Springer-Verlag, Berlin-Heidelberg-New York 1970, 415 S., 27 lei, $ 2.70.

ISSN:0047-6277    

DOI:10.1080/02331887208801085

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor

摘要:

Ankündingung der III. Tagung ”Mathematik und Kybernetik in der Ökonomie“ (MLÖ III) Vom 13.-16. Mai 1973 in Halle/Salle, DDR.

ISSN:0047-6277    

DOI:10.1080/02331887208801086

出版商:Akademie-Verlag    

年代:1972

数据来源: Taylor