The dual simplex method: The infinite-dimensional case
Copyright policy )The dual simplex method: The infinite-dimensional case
In three previous papers of the author [Cybernetics 19, 247-252 (1983; Zbl 0527.90068), Eng. Cybern. 20, 20-30 (1982; Zbl 0527.90079), and Autom. Remote Control 43, 1014-1020 (1983; Zbl 0529.49017)] the coordinate-free approach to simplex-type algorithms was developed. In this paper this approach is applied to the dual simplex method for linear and convex programming problems with linear constraints. It enables to consider the infinite-dimensional problems with finite number of inequality constraints without reduction to any kind of canonical form.
Methods of successive quadratic programming type, Convex programming, Numerical mathematical programming methods, dual simplex method, simplex-type algorithms, Linear programming, linear constraints, coordinate-free approach
Methods of successive quadratic programming type, Convex programming, Numerical mathematical programming methods, dual simplex method, simplex-type algorithms, Linear programming, linear constraints, coordinate-free approach
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!