Complete characterizations of stable Farkas’ lemma and cone-convex programming duality

ISSN： 0025-5610

Source： Mathematical Programming, Vol.114, Iss.2, 2008-08, pp. : 335-347

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Arcwise Connected Cone-Convex Functions and Mathematical Programming

By Fu J.Y. Wang Y.H.

Journal of Optimization Theory and Applications, Vol. 118, Iss. 2, 2003-08 ,pp. : 339-352

Springer Publishing Company

Access to resources Recommend Favorite

On Classes of Generalized Convex Functions, Gordan–Farkas Type Theorems, and Lagrangian Duality

By Frenk J.B.G. Kassay G.

Journal of Optimization Theory and Applications, Vol. 102, Iss. 2, 1999-08 ,pp. : 315-343

Springer Publishing Company

Access to resources Recommend Favorite

Locally Farkas–Minkowski Systems in Convex Semi-Infinite Programming

By Fajardo M.D. López M.A.

Journal of Optimization Theory and Applications, Vol. 103, Iss. 2, 1999-11 ,pp. : 313-335

Springer Publishing Company

Access to resources Recommend Favorite

Higher order duality in multiobjective programming with cone constraints

By Kim Do Sang Kang Hun Suk Lee Yu Jung Seo You Young

Optimization, Vol. 59, Iss. 1, 2010-01 ,pp. : 29-43

Taylor & Francis Ltd

Access to resources Recommend Favorite

Cutting planes from a mixed integer Farkas lemma

By Koppe M. Weismantel R.

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 207-211

Elsevier

Access to resources Recommend Favorite