摘要:

The paper presents in a self-contained form three improved versions of Scarf's combinatorial method for finding fixed points. The first version allows to avoid the use of slack elements in primitive sets and hence to work only with conventional subsimplices. The second makes it possible to restart as in Merrill's algorithm, while the third is a continuation procedure similar to the homotopy method by Eaves.

ISSN:0323-3898    

DOI:10.1080/02331938008842662

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

M. C. Kemp, Kimura: Introduction ot Mathematical Economics. Springer - Verlag New York - Heidelberg - Berlin, 1978, 249 S., DM 42.

ISSN:0323-3898    

DOI:10.1080/02331938008842663

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

In a general framework the interior penalty function method is interpreted in terms of nonconvex duality-stability relations. The canonical Lagrangian of the framework is the prototypical interior penalty function.

ISSN:0323-3898    

DOI:10.1080/02331938008842664

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

J. Schärf, H. Schierer und W. Baron: Programmieren mit dem Taschenrechner TI-57. R. Oldenbourg Verlag München 1978, 152 S., DM 19,80.

ISSN:0323-3898    

DOI:10.1080/02331938008842665

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

In this paper the duality theory for continuous linear programming problems is extended to problems defined in spaces of -p-times BocHNEB-integrable abstract functions (1 <p< ∞). Two duality theorems are proved, the first one including the existence of a primal optimal solution, the second one the existence of a dual optimal solution. As introduction the paper contains a short survey on results obtained in the field of duality theory for continuous programs, too.

ISSN:0323-3898    

DOI:10.1080/02331938008842666

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

In this paper relations of equivalence and for order on sets of mathematical programmes are introduced, facilitating the consistent analysis and construction of equivalent programming problems. Applying this approach, well-known decomposition principles (resource allocation, parametric decomposition) are analyzed.

ISSN:0323-3898    

DOI:10.1080/02331938008842667

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

On étudie le problème suivant: PourC∈N*=N\{0}, déterminern∈N*xi∈N*.pourtels queet maximisabt. On apporte une contribution thérique et pratique à la résolution de ce problème en utilisant la méthode des multiplications de Lagrange généralisés par EVERETT et la notion de bénéfice de Nicolas.

ISSN:0323-3898    

DOI:10.1080/02331938008842668

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

A method for solving convex integer programming problems is given. The method gives a sequence of feasible points with decreasing value of the objective function. Possibilities to accelerate the convergence and to estimate the error are shown. First computational results are given.

ISSN:0323-3898    

DOI:10.1080/02331938008842669

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

In this work an algorithm is presented to solve the zero-one programming problem with special additional constraints. Rules for the unique generation of index setscorresponding to the vectorsx∈Rn,xj∈{0,1},j= 1(1)nare given. Thereby only such index sets are generated, which fulfill the additional constraints. The number of generated index sets is reduced by means of tests, which suit to the problem.

ISSN:0323-3898    

DOI:10.1080/02331938008842670

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor

摘要:

In the present paper results of the author [2] concerning stability domains of pure integer linear programming problems are transferred to the case of mixed integer programming.

ISSN:0323-3898    

DOI:10.1080/02331938008842671

出版商:Akademic-Verlag    

年代:1980

数据来源: Taylor