DocServer

Characterizations of optimality for the abstract convex program with finite dimensional range

Borwein, Jonathan M. and Wolkowicz, H. (1981) Characterizations of optimality for the abstract convex program with finite dimensional range. Journal Aust. Math. Soc. , 30 . pp. 390-411.

Full text not available from this repository.

Abstract

This paper presents characterizations of optimality for the abstract convex program (P) v = inI{p(x):g(x)(E-S,x<Ea}> when S is an arbitrary convex cone in a finite dimensional space, U is a convex set and/; and g are respectively convex and S-convex (on Q). These characterizations, which include a Lagrange multiplier theorem and do not presume any a priori constraint qualification, subsume those presently in the literature.

Item Type: Article
Subjects: UNSPECIFIED
Faculty: UNSPECIFIED
Depositing User: Mrs Naghmana Tehseen
Date Deposited: 23 Feb 2015 13:54
Last Modified: 23 Feb 2015 13:54
URI: https://docserver.carma.newcastle.edu.au/id/eprint/1649

Actions (login required)

View Item