Journal article · 1977

Primal and dual optimality criteria in convex programming

Aharon Ben‐Tal, A. Charnes

Mathematical Methods of Operations Research, 21(5), 197–209 · Published 1 October 1977 · DOI 10.1007/bf01965717

View at the publisherCite this paper

In brief

“Primal and dual optimality criteria in convex programming” is a 1977 journal article by Aharon Ben‐Tal and A. Charnes, published in Mathematical Methods of Operations Research. OpenAlex counts 1 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
1
Field-weighted impact
0.57
References
7
Authors
2

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Ben‐Tal, A., & Charnes, A. (1977). Primal and dual optimality criteria in convex programming. Mathematical Methods of Operations Research, 21(5), 197–209. https://doi.org/10.1007/bf01965717

MLA 9

Ben‐Tal, Aharon, and A. Charnes. “Primal and dual optimality criteria in convex programming.” Mathematical Methods of Operations Research, vol. 21, no. 5, 1977, pp. 197–209. https://doi.org/10.1007/bf01965717.

Chicago

Ben‐Tal, Aharon and A. Charnes. 1977. “Primal and dual optimality criteria in convex programming.” Mathematical Methods of Operations Research 21 (5): 197–209. https://doi.org/10.1007/bf01965717.

Harvard

Ben‐Tal, A. and Charnes, A. (1977) ‘Primal and dual optimality criteria in convex programming’, Mathematical Methods of Operations Research, 21(5), pp. 197–209. doi:10.1007/bf01965717.

IEEE

A. Ben‐Tal and A. Charnes, “Primal and dual optimality criteria in convex programming,” Mathematical Methods of Operations Research, vol. 21, no. 5, pp. 197–209, 1977, doi: 10.1007/bf01965717.

BibTeX

@article{bental1977primal,
  title     = {{Primal and dual optimality criteria in convex programming}},
  author    = {Ben‐Tal, Aharon and Charnes, A.},
  journal   = {Mathematical Methods of Operations Research},
  year      = {1977},
  volume    = {21},
  number    = {5},
  pages     = {197--209},
  doi       = {10.1007/bf01965717},
  url       = {https://doi.org/10.1007/bf01965717}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis

  • convex optimization
  • optimality conditions
  • dual characterization
  • necessary and sufficient conditions
  • Karush-Kuhn-Tucker conditions
  • convex constraints
  • constraint qualification

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Ben‐Tal, A., & Charnes, A. (1977). Primal and dual optimality criteria in convex programming. Mathematical Methods of Operations Research, 21(5), 197–209. https://doi.org/10.1007/bf01965717

How many times has this paper been cited?

1 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Aharon Ben‐Tal, A. Charnes.

What is the DOI of this paper?

10.1007/bf01965717. The permanent link is https://doi.org/10.1007/bf01965717.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.