Skip to main content

Dual Linear Programs

  • Chapter
Book cover Linear Programming

Part of the book series: Springer Texts in Electrical Engineering ((STELE))

  • 466 Accesses

Abstract

In this chapter we show that it is possible to associate to any linear program another linear program (which we call “dual”). Using different types of arguments we prove how close the relationship is between a linear program and its dual. In fact, these two programs must be considered as two facets of the same problem rather than as two different problems. And we will see in subsequent chapters that when one solves a linear program, its dual is solved at the same time. Thus the concept of duality is very central to linear programming and this is why it is introduced so early in the book.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Author information

Authors and Affiliations

Authors

Editor information

John B. Thomas

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer Science+Business Media New York

About this chapter

Cite this chapter

Sakarovitch, M. (1983). Dual Linear Programs. In: Thomas, J.B. (eds) Linear Programming. Springer Texts in Electrical Engineering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-4106-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4106-3_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-90829-8

  • Online ISBN: 978-1-4757-4106-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics