Journal article · 1967

The Convex Simplex Method

Willard I. Zangwill

Management Science, 14(3), 221–238 · Published 1 November 1967 · DOI 10.1287/mnsc.14.3.221

View at the publisherCite this paper

In brief

“The Convex Simplex Method” is a 1967 journal article by Willard I. Zangwill, published in Management Science. OpenAlex counts 93 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
93
Most cited in
2013 (2)
Field-weighted impact
1.54
References
6
Authors
1

Abstract

This paper presents a method, called the convex simplex method, for minimizing a convex objective function subject to linear inequality constraints. The method is a true generalization of Dantzig's linear simplex method both in spirit and in the fact that the same tableau and variable selection techniques are used. With a linear objective function the… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

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

APA 7

Zangwill, W. I. (1967). The Convex Simplex Method. Management Science, 14(3), 221–238. https://doi.org/10.1287/mnsc.14.3.221

MLA 9

Zangwill, Willard I. “The Convex Simplex Method.” Management Science, vol. 14, no. 3, 1967, pp. 221–238. https://doi.org/10.1287/mnsc.14.3.221.

Chicago

Zangwill, Willard I. 1967. “The Convex Simplex Method.” Management Science 14 (3): 221–238. https://doi.org/10.1287/mnsc.14.3.221.

Harvard

Zangwill, W. I. (1967) ‘The Convex Simplex Method’, Management Science, 14(3), pp. 221–238. doi:10.1287/mnsc.14.3.221.

IEEE

W. I. Zangwill, “The Convex Simplex Method,” Management Science, vol. 14, no. 3, pp. 221–238, 1967, doi: 10.1287/mnsc.14.3.221.

BibTeX

@article{zangwill1967convex,
  title     = {{The Convex Simplex Method}},
  author    = {Zangwill, Willard I.},
  journal   = {Management Science},
  year      = {1967},
  volume    = {14},
  number    = {3},
  pages     = {221--238},
  doi       = {10.1287/mnsc.14.3.221},
  url       = {https://doi.org/10.1287/mnsc.14.3.221}
}

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

Citations by year

YearCitationsShare of the best year
201322
201422
201522
201611
201811
202222
202311
202411
202622

Its field-weighted citation impact is 1.54: it has been cited 1.54 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research

  • convex optimization
  • linear programming
  • simplex method
  • linear inequality constraints
  • convex objective function
  • feature selection

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Zangwill, W. I. (1967). The Convex Simplex Method. Management Science, 14(3), 221–238. https://doi.org/10.1287/mnsc.14.3.221

How many times has this paper been cited?

93 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?

Willard I. Zangwill.

What is the DOI of this paper?

10.1287/mnsc.14.3.221. The permanent link is https://doi.org/10.1287/mnsc.14.3.221.

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.