摘要:

I n pursuance of the F. NOŽIČKA'S paper [3] the question raises which dimension has a convex cone resp. generally a convex polyhedron, given by linear equations and inequalities. In the paper is described how to determine this dimension using the simplex method. One sees, that the problem in the main can be reduced to the finding of admissible basic solutions of a sequence of systems of linear equations and inequalities which are decreasing in size.

ISSN:0047-6277    

DOI:10.1080/02331887008801012

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

The linear multiple transportation problem with proportional quantitative changes consists of N simple transportation problem (steps) which are interconnected by the fact that the places of destination of the (k – 1)-th step simultaneously are starting places of thek-th step ;k= 2,3,…,N. Besides, a t the transition of the (k – 1)-th step to the k-fh step there is admissible a proportional quantitative change of the goods to be transported which may be different a t all places. The given solution method represents a generalization of the u-v-algorithm for the solution of classical transportationproblem to a multiple problem. After the analytical formulation of the problem there are formulized some propositions forming the basis for the solution algorithm given a t the end of the paper. I n the following sections the determination of anadmissible basic solution, the calculation of the dual variables and the exchange of basic variables are examined in detail.

ISSN:0047-6277    

DOI:10.1080/02331887008801013

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

In this paper are considered twofold-oneparametric linear programming problems with independing parameters, that means, linear programming problems, in which the coefficients of the objective function depend on one parameter, the components of the right sides of the constraints on another. The theoretical result consists in that the parameter plane, spanned by these two parameters is decomposed into maximal rectangles with edges parallel to axes so that for all pairs of parameters belonging to the same rectangle the same solution, still containing the right-side parameter is optimal and admissible resp. no solution exists. The rectangles, belonging to optimal admissible solutions are not overlapping. Having stated the theoretical result one describes a procedure for solving practically such problems and finaly there is given a nontrivial example.

ISSN:0047-6277    

DOI:10.1080/02331887008801014

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

At first the authors give a conception of structural stability for a one-parametric optimization problem. I n the second part there are proved some interesting theorems on convexity intervals, which partially are of importance for the numerical computation of these intervals. At last the method of THEIL and VAN DE PANNE is modified in such a manner, that they get a decomposition of the given convexity interval into stability regions. I n the caae of non-degeneration this decomposition is unique.

ISSN:0047-6277    

DOI:10.1080/02331887008801015

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

This paper will inform about a possibility, to make cuts stronger in the GONORY all-integer algorithm. To this end we define a relation of dominance between cuts; by means of this relation we then decide whether a stronger cut can be obtained by changing the constant term. Furthermore, two simple sufficient conditions are given for the existence and non-existence, respectively, of a dominating cut. Finally, some unsolved problems are mentioned and remarks about further studies are given.

ISSN:0047-6277    

DOI:10.1080/02331887008801016

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

Two problems of job scheduling on machines are considered. In both problems all jobs must be processed through the machines in the same order, and the order of jobs is the same on all machines. “Branch and Bound”-Algorithms (analogously to [I]) are formulated for the two following objectives a) RFP I : minimize make-span, b) RFP 11: minimize total idle time of all machines, to achieve an optimal solution. Waiting times are fixed to be zero for all jobs. Restrictions in the number of the machines .and the jobs are not necessary. The working of algorithms has been illustrated by numerical examples.

ISSN:0047-6277    

DOI:10.1080/02331887008801017

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

We consider arbit,rary regression modelsy=Xβ+ ϵ, where the covariance matrix from ϵ can also be singulary. First we determine optimal homogeneous and inhomogeneous linear predictions fory*where the true equation fory*bey*=Xβ+ϵ*As the risk we use a mean quadratic (not necessary) distance. Then we study the possibilities for improving the best homogeneous unbiased prediction. We show, that this is possible, if there are additional informations aboutX βif for instance ∣X β∣ is bounded. After this me consider the improvement of a homogeneous prediction by admitting inhomogeneous predictions. In a further section we determine for (may be even singulary) modelsy=X β+ ϵ a GAUSS-MARKOV estimation for β and we get also statements of the question in which cases this estimation can be improved. Thereby the strict connection between unbiased predictions and G.-M. estimations is used.

ISSN:0047-6277    

DOI:10.1080/02331887008801018

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

H. Schlitt Stoehastisehe Vorgänge in linearen und niehtlinearen Regelkreisen. VEB Verlag Technik, Berlin 1968. Lizenzausgabe des Verlags F. Vieweg & Sohn GmbH, Braunschweig. 336 S., Abb., 42, — 336 S., 223 Abh., 42,— M.

ISSN:0047-6277    

DOI:10.1080/02331887008801019

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

摘要:

vom 28.9.—4.10.1969 in Gohren/Rügen, DDR.

ISSN:0047-6277    

DOI:10.1080/02331887008801020

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor

ISSN:0047-6277    

DOI:10.1080/02331887008801021

出版商:Akademie-Verlag    

年代:1970

数据来源: Taylor