(1) Department of Mathematics, Statistics, and Computer Science, Dalhousie University, B3H 4H8 Halifax, N.S., Canada;(2) Department of Mathematical Sciences, University of Delaware, 19716 Newark, DE, USA
Abstract:
A new, simple, constraint qualification for infinite dimensional programs with linear programming type constraints is used to derive the dual program; see Theorem 3.1. Applications include a proof of the explicit solution of the best interpolation problem presented in [8].