摘要:

We will prove that a generalized convex programming problem is normal if and only if a sequence of appropriately disturbed problems converges in value to the value of the undisturbed problem. The generalization consists in admitting for so-called supremal points, a notion closely related to Paeeto-optimal points.

ISSN:0323-3898    

DOI:10.1080/02331938208842759

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

J.Kriens: Convex Analysis and Mathematical Economics. Lecture Notes in Economics and Mathematical Systems Vol.168.Springer-Verlag, Berlin, Heidelberg, New York 1979; 136 S.,DM 18, –.

ISSN:0323-3898    

DOI:10.1080/02331938208842760

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

In this paper some connections between the following generalizations of convex conjugate functions and corresponding sets are given: quasi-conjugate functions, φ-conjugate functionsK-functions, convexity properties of set-families, Especially, aK-function is constructed for quasi-convex optimization problems.

ISSN:0323-3898    

DOI:10.1080/02331938208842761

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

Eaves proved, that the solutions of the nonlinear complementarity problem are contained in the set of stationery points of a class of suitable defined variational problems. In the paper an extension of this set of stationery points is introduced. In an applications to the linear complementarity problem the properties of the extended act are used for a modification of Lemke's method. In the modified algorithm there is the possibility for the determination of more than one solution.

ISSN:0323-3898    

DOI:10.1080/02331938208842762

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

W. Kobitzsch: Milkroprozessoren - Aufbau und Wirkungsweise. Teil 1: Grundlegen, Relihe Datenverarbeitung. R. Oldenbourg Verlag Münehen, Wien 1977, 204 S., DM 38, –.

ISSN:0323-3898    

DOI:10.1080/02331938208842763

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

This paper presents a decomposition algorithm for dual angular linear programs, which also may be extended to a wider class of structured linear programs. In the algorithm, firstly, the linking variables are fixed at given values to partition the problem into several subproblems. Secondly, an optimal setting of the linking variables is determined, given that the bases for the subproblems are fixed. Then, the bases for the subproblems are changed so as to improve the entire problem. The computational experience shows that the number of cycles to adjust the linking variables required for optimality is nearly equal to the number of the subproblems, that is, its convergence behaves very well as compared with the column-generation scheme.

ISSN:0323-3898    

DOI:10.1080/02331938208842764

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

Basing on the close relation between solutions of auxiliary problems and perturbated primal problems a new method for handling constrained optimization problems via unconstrained ones is derived. In the proposed method are included as well the well known augmented Lagrangian techniques as new barrier-shifting and exterior centers meihods.Moreover in the convex case the shifting methods locally introduced by Mangasarian are shown t o converge globally.

ISSN:0323-3898    

DOI:10.1080/02331938208842765

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

For a discrete minimasproblem a 2-stage algorithm is presented. This algorithm, a combination of gradient-type algorithms of Dem'Yanov and Newton method, adds the good behavior of the global convergence of descent methods to the fast final convergence of the Newton method.

ISSN:0323-3898    

DOI:10.1080/02331938208842766

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

Me examine the structure of minimax strategic of player 1 in a two-person zero-sum game (ZPNS) with “analytical” kernel, if the set of pure strategies of player 1 is a compact sub-set of an Euclidean space.First we generalize a result mentioned by Karlin concerning minimax strategies in a ZPNS on the unit square with analytical kernel. Next we examine ZPNS playing un important róle in statistical decision theory and derive a result on least favourable distributions. The proof of these results is based on a theorem concerning the zero-set of an analytical function of several variables, which is proved in the first part of this paper.

ISSN:0323-3898    

DOI:10.1080/02331938208842767

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor

摘要:

J.Todd: Basic Numerical Mathematics. Vol.2: Numerical Algebra. Birkhäuser Verlag Basel-Stuttgart 1977,216 S.,sFr.48, –.

ISSN:0323-3898    

DOI:10.1080/02331938208842768

出版商:Akademic-Verlag    

年代:1982

数据来源: Taylor