ISSN:
1436-4646
Keywords:
Primary 90C25, 49B27
;
Secondary 90C48, 52A07, 65K05
;
Convex programming
;
duality
;
constraint qualification
;
semi-infinite programming
;
constrained approximation
;
spectral estimation
;
transportation problem
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In Part I of this work we derived a duality theorem for partially finite convex programs, problems for which the standard Slater condition fails almost invariably. Our result depended on a constraint qualification involving the notion ofquasi relative interior. The derivation of the primal solution from a dual solution depended on the differentiability of the dual objective function: the differentiability of various convex functions in lattices was considered at the end of Part I. In Part II we shall apply our results to a number of more concrete problems, including variants of semi-infinite linear programming,L 1 approximation, constrained approximation and interpolation, spectral estimation, semi-infinite transportation problems and the generalized market area problem of Lowe and Hurter (1976). As in Part I, we shall use lattice notation extensively, but, as we illustrated there, in concrete examples lattice-theoretic ideas can be avoided, if preferred, by direct calculation.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01581073
Permalink
