Titlebook: Infinite Programming; Proceedings of an In Edward J. Anderson,Andrew B. Philpott Conference proceedings 1985 Springer-Verlag Berlin Heidelb

卡死偷電

Conditions for the Closedness of the Characteristic Cone Associated with an Infinite Linear System,tant result of Duffin, Jeroslow and Karlovitz, characterizing those sets which generate a closed convex cone, is obtained. In the second part, we apply these results to supply different sufficient conditions for the Farkas-Minkowski property of a semi-infinite linear system. Finally, by means of the

不真

不能平靜

Algebraic fundamentals of linear programming, . structure as possible on the spaces in which the linear program is posed. We give an algebraic characterization of basic solutions for a linear program posed in a more or less arbitrary ordered vector space. Applying this to examples resolves some difficulties that have been previously found in e

Self-Help-Group

不可接觸

Semi-Infinite Programming and Continuum Physics,se also opens up promising avenues for numerical treatment. In this paper the unification is extended to some problems in continuum physics whose mathematical formulations involve choices of function spaces, techniques of integration by parts in one and two dimensions, and finite element numerical a

PANIC

On the computation of membrane-eigenvalues by semi-infinite programming methods,ric semi-infinite problem, the parameter of which has to be adapted in such a way that a certain (nonlinear and nondiffe-rentiable) function is minimized. Some numerical methods for achieving this minimization efficiently will be discussed.

溺愛

Lagrangian Methods for Semi-Infinite Programming Problems, convergent methods are available, and efficient and stable variants of two of these are presented. Globalization of local methods may often by achieved by imbedding them in a conventional two-phase framework. However, an alternative approach which makes the second phase more robust is to make use o

關(guān)節(jié)炎

松果

Extreme Points and Purification Algorithms in General Linear Programming,eme points are discussed, and a purification algorithm is suggested for finding improved extreme points. The method is shown to be applicable to a family of linear programs including semi-infinite and separably-infinite problems. The relevance of the method to recent work on a primal semi-infinite s

HATCH

Network Programming in Continuous Time with Node Storage,h satisfy a flow-conservation constraint at each node and minimize the total cost of flow. If the arc capacities and costs are allowed to vary as functions of time, and storage is permitted (with some incurred cost) at the nodes of the network, then the problem becomes an infinite-dimensional linear