摘要:

In this paper special min-max problems are reduced to a certain type of problem in which a concave function is to be minimized over a convex set. On the basis of the extension principle a solution procedure for this problem is developed and the first feasible solution yields a t the same time the global minimum. Since the feasible set is defined by linear constraints, the algorithm consists essentially in the application of the simplex transformation.

ISSN:0047-6277    

DOI:10.1080/02331887308801104

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

Scheduling problems can be formulated as mathematical programs with integrity requirement on some variables. In this paper some properties of linearly solvable mixed integer programing are discussed, and experiments are reported where integer solutions have been obtained by linear programming.

ISSN:0047-6277    

DOI:10.1080/02331887308801105

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

Investigations on the convergence of gradient proceedures for the minimization of a strong and bounded convex continuous functional over a BANACH space are dealt with. Then procedures with suitable and optimal suitable directions with optimal width of steps and undere relaxation are considered. all cases yield linear convergence, though with different convergence generating factors. Finally a comparison is made with descent procedures for functional equations.

ISSN:0047-6277    

DOI:10.1080/02331887308801106

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

As a part of investigations about flight operating scheduling of airlines there results the problem how to attach the individual aircrafts to te turns of a gicen time table and which of several variants of a time table is the best for attaching the aircrafts to the turns of these time table variants. For this aircraft scheduling the present paper gives an optimazation approach which takes into account the necessary maintenance but does not take into account unforeseen defects of aircrafts.

ISSN:0047-6277    

DOI:10.1080/02331887308801107

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

The shortest path problem has been solved by FORD and FULKERSON [1] using a network method. COOK and HOLSEY [2] have given an algorithm for a generalization of te problem by applying dynamic programming to a network having time dependent edges. E. KLAFSZKY [3] has described a procedure using the flow method of FORD and FULKERSON which gives the shortest path in addition to the length of the path. CHARNES and RAIKE [4] applied linear programming to another generalization of te shortest path problem. This generalized problem is dealt with in this paper. The problem can be solved by the FORD and FULKERSON's procedure following the train of thought described by E. KLAFSZKY.

ISSN:0047-6277    

DOI:10.1080/02331887308801108

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

LAGRANGE's formula has been used to derive certain expression which occur frequently in the theory of queues. The method is perhaps the simplest one to prove that these expressions are probability distributions. In particular the generalized forms of POISSON and negative binomail distributions are obtained. Expressions for certain summaation series have also been derived. The use of the formula enables us to relax some conditions on the parameters of these distributions.

ISSN:0047-6277    

DOI:10.1080/02331887308801109

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

The present paper discusses a busy-period distribution of a multi-server queuing problem wherein the arrivals are by POISSON process with rate λ and the service times are exponentially distributed with the same mean 1/μ for all theC-servers. The particular cases have been dealt with explicitly.

ISSN:0047-6277    

DOI:10.1080/02331887308801110

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

In this paper the values of the moments around the mean,B1andB2are calculated for order statistics in samples drawn from the logistic distribution. Also the probability density functions for the range, the difference between two consecutive order statistics and the midrange are derived.

ISSN:0047-6277    

DOI:10.1080/02331887308801111

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor

摘要:

H. Müller-Merbach: Operations Research Verlag Franz Vahlen GmbH, Berlin and Frankfurt a.m. 1970, 511 S.

ISSN:0047-6277    

DOI:10.1080/02331887308801112

出版商:Akademie-Verlag    

年代:1973

数据来源: Taylor