Convex analysis treated by linear programming

  title={Convex analysis treated by linear programming},
  author={Richard James Duffin},
  journal={Math. Program.},
The theme of this paper is the application of linear analysis to simplify and extend convex analysis. The central problem treated is the standard convex program -minimize a convex function subject to inequality constraints on other convex functions. The present approach uses the support planes of the constraint region to transform the convex program into an equivalent linear program. Then the duality theory of infinite linear programming shows how to construct a new dual program of bilinear… CONTINUE READING
1 Citations
10 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

programs", in Linear Inequalities and Related Systems (H

  • R. J. Duffin, infinite
  • 1956
Highly Influential
6 Excerpts

Compound classification schemes for convex conjugate transform dual families

  • K. Kortanek
  • GSIA Report No
  • 1972
Highly Influential
5 Excerpts

Linear programming in reflexive spaces

  • Kallina, Carl, A. C. Williams
  • SIAM Review
  • 1971
Highly Influential
4 Excerpts

Convex Analysis

  • R. T. Rockafellar
  • 1971
2 Excerpts

Symmetric duality for generalized unconstrained geometric programming

  • E. L. Peterson
  • SIAM J. Appl. Math
  • 1970
2 Excerpts

Nonlinear Programming9 McGraw-Hill

  • Mangasarian, L 0.
  • New York,
  • 1969
2 Excerpts

An infinite linear program with a duality gap "

  • A. M. Geoffrion
  • Management Sciences
  • 1965

Karlovitz, "An infinite linear program with a duality gap

  • L A.
  • Management Sciences
  • 1965
2 Excerpts

Programmes in paired spaces

  • K. S. Kretschmer
  • Canadian J. Math
  • 1961
3 Excerpts

Similar Papers

Loading similar papers…