首页 | 本学科首页   官方微博 | 高级检索  
     


A simple constraint qualification in infinite dimensional programming
Authors:J. M. Borwein  H. Wolkowicz
Affiliation:(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].
Keywords:Infinite dimensional linear programming  semi-infinite programming  constraint qualification  optimality conditions  dual program
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号