摘要:

The one constraint: general (non zero-one) integer progrmming problem is solvad by an algorithm "chat is a composition of a dynamic programming procedure and a branch and-bound algorithm: The procedura way be used for solving this type of problems (for example the renewal problem) or for calculating bounds in a beaach-aed-bound algorithre for several must probably the algorithm can be extended for other type of problems, for example for the several constraint linear integer programming problem, as it is suggested in paragraph 5.

ISSN:0047-6277    

DOI:10.1080/02331887408801155

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

In the presenc paper the notion "structure of a solution" as ciefired in [7] for an ordinary linear programming problem (1. p. problem) IS used to determine so-called uniqueness regions. Such a region is the set of all points of the parameter set yielding an ordinary 1. p. problern wit,h the same: uniquely refiner structure of the solution. Uniqueness regions are proved to be open sets in the parameter space and connections between them and stability regions as defined in [7] are stated. After introducing a certain regularity condition, which expresses that degeneracy always can bc overcome by slightly changing the parameters, it is shown, that the closure wit,h respect to the topology of the parameter space of any uniqueness region represents the corresponding stability region. I n the paper theoretical. fundamentals of parametric 1. p. problems with constant matrix of constraints are studied in order to classify parametric 1. p. problems of this kind having special parameter; dependence and to state common properties owing all problems of this type.

ISSN:0047-6277    

DOI:10.1080/02331887408801156

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

In the barrier mathod and.6 in. the method of centres one has to suppose that, a regldaritycondition in fulfilied in order to excure that every aecrecation point of the solotions of the sequence of supporting problems selves the ,origira optimization problam.Varions conditions are used for regularity conditions in papers on the theory of barrier methods and methods of centres. We summarizo those different conditions and investigate their mutual relations. Moreover, it is shown that some well known regularity conditions of the Kcen-Tucker-theory are also regularity conditions in the sense considered here. The barrier method and the method of centres are represented in linear topological spaces.

ISSN:0047-6277    

DOI:10.1080/02331887408801157

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

In the sense of an unrestricted choice of a parameter in the Borel-Tanner distribution a distribution known as a generalized Poisson is deswibed. Approximations to the negative binomial sums using this distribution are given. The approximate values are more accurate than t,he ones obtained by using the incomplete gamma functions. The accuracy so obtained suggests the use of one model for another.

ISSN:0047-6277    

DOI:10.1080/02331887408801158

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

Several methods for the recognition of elIiptica1 (and circular) shape amidst stochastic variation are described and evaluated by simulation and by application to a medical diagnostic problem. Methods based on symmetry properties are recommended whenever symmetrical deviations are of minor interest and simple routines are important, whilst methods based on relations between parts of intersecting chords arc recommended in other cases.

ISSN:0047-6277    

DOI:10.1080/02331887408801159

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

A general theory of parameter identifiability unbiased decision functions and estimable optimal decision sets is developed covering the usual concepts of identifiability, unbiasedness and estimability. For the estimation of linear parameters in multivariate linear models, the concepts of linear estimability and identifiability coincide, and with a suitable choice of the loss function every linear parameter can be viewed as estimable and identifiable. It is shown, that the condition of reducibility used by H. Bunke to construct a solution of the approgression problem is identifiability of the projection of the unknown regression function on the space of approximating functions.

ISSN:0047-6277    

DOI:10.1080/02331887408801160

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

As an approximation of the random parameters in a linear regression model a linear Bayesian decisian rule with restricted minimax property is considered. Since the regression model is assumed t o occur repeatedly (but with different regressor matrix), the unknown para meters of the peior distribution, which are aneded. can be estimated Asymptotie properties of the risk function of the resulding empirical Bayesian decision rnle are is:inverigated.

ISSN:0047-6277    

DOI:10.1080/02331887408801161

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

摘要:

In a normal linear model necessary and suffieient for parameiers of she coveriance matrix to be estimable is that they are quadratic estimable. This does not coincide with identifiability.

ISSN:0047-6277    

DOI:10.1080/02331887408801162

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

ISSN:0047-6277    

DOI:10.1080/02331887408801163

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor

ISSN:0047-6277    

DOI:10.1080/02331887408801164

出版商:Akademie-Verlag    

年代:1974

数据来源: Taylor