Convex Programming by Tangential Approximation

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 1963 English Publisher:Institute for Operations Research and the Management Sciences (INFORMS)Journal:Management Science, volume 9, pages 600-612 (issn: 0025-1909, eissn: 1526-5501,

Copyright policy )

Authors: H. O. Hartley; R. R. Hocking;

doi: 10.1287/mnsc.9.4.600

Convex Programming by Tangential Approximation

- Summary
- Subjects
- Metrics

Abstract

This paper describes an algorithm for the solution of the convex programming problem using the simplex method. The algorithm is computationally very simple, requiring the solution of a single linear programming problem which can be accomplished with only slight modification of existing computer codes for the revised simplex method.

Related Organizations

Iowa State University
United States

Keywords

Convex programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	31
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average