On A characterization of optimality in convex programming

A. Ben-Israel; A. Ben-Tal

doi:10.1007/BF01580372

On A characterization of optimality in convex programming

A. Ben-Israel, A. Ben-Tal

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.

Original language	English (US)
Pages (from-to)	81-88
Number of pages	8
Journal	Mathematical Programming
Volume	11
Issue number	1
DOIs	https://doi.org/10.1007/BF01580372
State	Published - Dec 1976
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
General Mathematics

Access to Document

10.1007/BF01580372

Cite this

@article{40d27d7ab28741228db74d2e2d093858,

title = "On A characterization of optimality in convex programming",

abstract = "Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.",

author = "A. Ben-Israel and A. Ben-Tal",

year = "1976",

month = dec,

doi = "10.1007/BF01580372",

language = "English (US)",

volume = "11",

pages = "81--88",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1",

}

TY - JOUR

T1 - On A characterization of optimality in convex programming

AU - Ben-Israel, A.

AU - Ben-Tal, A.

PY - 1976/12

Y1 - 1976/12

N2 - Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.

AB - Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.

UR - http://www.scopus.com/inward/record.url?scp=34250386351&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250386351&partnerID=8YFLogxK

U2 - 10.1007/BF01580372

DO - 10.1007/BF01580372

M3 - Article

AN - SCOPUS:34250386351

SN - 0025-5610

VL - 11

SP - 81

EP - 88

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -

On A characterization of optimality in convex programming

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this