A Farkas lemma for difference sublinear systems and quasidifferentiable programming

A Farkas lemma for difference sublinear systems and quasidifferentiable programming

0.00 Avg rating0 Votes
Article ID: iaor19951898
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 109
End Page Number: 125
Publication Date: Jan 1994
Journal: Mathematical Programming (Series A)
Authors: , ,
Keywords: programming: convex
Abstract:

A new generalized Farkas theorem of the alternative is presented for systems involving functions which can be expressed as the difference of sublinear functions. Various other forms of theorems of the alternative are also given using quasidifferential calculus. Comprehensive optimality conditions are then developed for broad classes of infinite dimensional quasidifferentiable programming problems. Applications to difference convex programming and infinitely constrained concave minimization problems are also discussed.

Reviews

Required fields are marked *. Your email address will not be published.