Skip to main content
SpringerLink
Log in

Primal-Dual Pairs

  • Chapter
Linear Optimization and Extensions

Part of the book series: Algorithms and Combinatorics ((AC,volume 12))

  • 1366 Accesses

Abstract

For every linear programming problem we have a “dual” linear programming problem. Whereas in the original or primal linear program the variables are associated with the columns of the constraint matrix, in the dual linear program the variables are associated with the rows of the constraint matrix. To bring out the symmetry of the construction of a primal-dual pair of linear programs we consider first the general case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Cahn, A.S. [ 1948 ] “The warehouse problem”, Bull. Amer.Math.Soc. 54 10–73.

    Google Scholar 

  • Dantzig, G.B. [ 1982 ] “Reminiscences about the origins of linear programming”, Operations Research Letters 1 43–48.

    Article  MathSciNet  Google Scholar 

  • Gale, D., Kuhn, H.W. and A.W. Tucker [ 1951 ] “Linear programming and the theory of games”, in Koopmans (ed) Activity Analysis of Production and Allocation, Wiley, New York.

    Google Scholar 

  • Goldman, A.J. and A.W. Tucker [ 1956 ] “Theory of linear programming”, in Kuhn and Tucker (eds), Linear Inequalities and Related Systems, Princeton U. Press, Princeton, 53–97.

    Google Scholar 

  • Weingartner, H.M. [ 1967 ] Mathematical Programming and the Analysis of Capital Budgeting Problems, Markham Publ. Co., Chicago.

    Google Scholar 

  • Farkas, J. [ 1902 ] “Theorie der einfachen Ungleichungen”, Journal für die reine und angewandte Mathematik 124 1–27.

    Google Scholar 

  • Goldman, A.J. [ 1956 ] “Resolution and separation theorems for polyhedral convex sets”, in Kuhn and Tucker (eds) Linear Inequalities and Related Systems, Princeton U. Press, Princeton, 41–51.

    Google Scholar 

  • Gordan, P. [ 1873 ] “Über die Auflösung linearer Gleichungen mit reellen Coefficienten”, Mathematische Annalen VI 23–28.

    Article  MathSciNet  Google Scholar 

  • Kirchberger, P. [ 1903 ] “Über Tschebyschefsche Annäherungsmethoden”, Mathematische Annalen 57 509–540.

    Article  MathSciNet  MATH  Google Scholar 

  • Kuhn, H.W. [ 1956 ] “Solvability and consistency for systems of linear equations and inequalities”, The American Mathematical Monthly 63 217–232.

    Article  MathSciNet  MATH  Google Scholar 

  • Mangasarian, O.L. [ 1969 ] Nonlinear Programming, McGraw-Hill, New York.

    MATH  Google Scholar 

  • Motzkin, Th.S. [1933] Beiträge zur Theorie der linearen Ungleichungen,Doctoral

    Google Scholar 

  • Thesis, University of Basel. English translation in Cantor et al (eds) Theodore S. Motzkin: Selected Papers, Birkhäuser, Boston, 1983 1–81.

    Google Scholar 

  • Stiemke, E. [ 1915 ] “Über positive Lösungen homogener linearer Gleichungen”, Mathematische Annalen 76 340–342.

    Article  MathSciNet  MATH  Google Scholar 

  • Tucker, A.W. [ 1956 ] “Dual systems of homogeneous linear equations”, in Kuhn and Tucker (eds) Linear Inequalities and Related Systems, Princeton U. Press, Princeton, 3–18.

    Google Scholar 

  • Beale, E.M.L. [ 1954 ] “An alternative method for linear programming”, Proceedings of the Cambridge Philosophical Society 50 513–523.

    Article  MathSciNet  MATH  Google Scholar 

  • Bland, R. [ 1977 ] “New finite pivot rules for the simplex method”, Mathematics of Operations Research 2 103–107.

    Article  MathSciNet  MATH  Google Scholar 

  • Fourier, J. [ 1822 ] Théorie analytique de la chaleur, republished in Grattan-Guiness, I. [1972] Joseph Fourier 1768–1830, MIT Press, Cambridge.

    Google Scholar 

  • Gay, D.M. [ 1987 ] “A variant of Karmarkar’s linear programming algorithm for problems in standard form”, Mathematical Programming 37 81–90.

    Article  MathSciNet  MATH  Google Scholar 

  • Grigoriadis, M.D. [ 1971 ] “A dual generalized upper bounding technique”, Management Science 17 269–284.

    Article  MATH  Google Scholar 

  • Lemke, C.E. [ 1954 ) “The dual method of solving the linear programming problem”, Naval Research Logistics Quarterly 1 36–47.

    Article  MathSciNet  Google Scholar 

  • Wagner, H.M. [ 1958 ] “The dual simplex algorithm for bounded variables”, Naval Research Logistics Quarterly 5 257–261.

    Article  MathSciNet  Google Scholar 

  • Freund, R.M. [ 1985 ] “Postoptimal analysis of a linear program under simultaneous changes in the matrix coefficients”, Mathematical Programming Study 24 1–13.

    Article  MathSciNet  MATH  Google Scholar 

  • Gass, S.I. and T.L. Saaty [ 1955 ] “The computational algorithm for the parametric objective function”, Naval Logistics Research Quarterly 2 39–45.

    Article  MathSciNet  Google Scholar 

  • Gass, S.I. and T.L. Saaty [ 1955 ] “Parametric objective function. Part II: Generalization”, Operations Research 3 395–401.

    Article  MathSciNet  Google Scholar 

  • Saaty, T.L. and S.I. Gass [ 1954 ] “The parametric objective function. Part I”, Operations Research 2 316–319.

    Article  MathSciNet  Google Scholar 

  • Bixby, R.E. [1989] Personal communication.

    Google Scholar 

  • Crowder, H. and M. Padberg [ 1980 ] “Solving large-scale symmetric traveling salesman problems to optimality”, Management Science 26 393–410.

    Article  MathSciNet  Google Scholar 

  • Crowder, H., E.L. Johnson and M. Padberg [ 1983 ] “Solving large-scale zero-one linear programming problems”, Operations Research 31 803–834.

    Article  MATH  Google Scholar 

  • Forrest, J.H. [1989] Personal communication.

    Google Scholar 

  • Grötschel, M., M. Jünger and G. Reinelt [ 1984 ] “A cutting plane algorithm for the linear ordering problem”, Operations Research 32 1195–1220.

    Article  MathSciNet  MATH  Google Scholar 

  • Grötschel, M. and O. Holland [ 1991 ] “Solution of large-scale symmetric travelling salesman problems”, Mathematical Programming 51 141–202.

    Article  MathSciNet  MATH  Google Scholar 

  • Hoffman, K.L. and M. Padberg [ 1985 ] “LP-based combinatorial problem solving”, Annals of Operations Research 4 145–194.

    Article  MathSciNet  Google Scholar 

  • Hoffman, K.L. and M. Padberg [ 1991 ] “Improving LP-representations of zero-one linear programs for branch-and-cut”, ORSA Journal on Computing 3 121–134.

    Article  MATH  Google Scholar 

  • Hoffman, K.L. and M. Padberg [ 1993 ] “Solving airline crew scheduling problems by branch-and-cut”, Management Science 39 657–682.

    Article  MATH  Google Scholar 

  • Padberg, M. and S. Hong [ 1980 ] “On the symmetric travelling salesman problem: a computational study”, Mathematical Programming Study 12 78–107.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg, M. and G. Rinaldi [ 1987 ] “Optimization of a 532-city symmetric traveling salesman problem by branch-and-cut”, Operations Research Letters 6 1–7.

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg, M. and G. Rinaldi [ 1991 ] “A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems”, SIAM Review 33 60–100.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leonard N. Stern School of Business, Statistics and Operations Research Department, New York University, 44 West 4th Street, Suite 868, 10012-1126, New York City, NY, USA

    Manfred Padberg

Authors
  1. Manfred Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Padberg, M. (1999). Primal-Dual Pairs. In: Linear Optimization and Extensions. Algorithms and Combinatorics, vol 12. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12273-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-12273-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-08511-6

  • Online ISBN: 978-3-662-12273-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation