DocServer

A simple constraint qualification in infinite dimensional programming

Borwein, Jonathan M. and Wolkowicz, H. (1986) A simple constraint qualification in infinite dimensional programming. Mathematical Programming, 35 . pp. 83-96.

Full text not available from this repository.

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].

Item Type: Article
Subjects: UNSPECIFIED
Faculty: UNSPECIFIED
Depositing User: Mrs Naghmana Tehseen
Date Deposited: 20 Feb 2015 17:02
Last Modified: 20 Feb 2015 17:02
URI: https://docserver.carma.newcastle.edu.au/id/eprint/1606

Actions (login required)

View Item