Loading [MathJax]/extensions/mml2jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Embed Hypothes.is?
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
  • Include attachments
Searching in
About 1 results
  • https://math.libretexts.org/Bookshelves/Linear_Algebra/Map%3A_Linear_Algebra_(Waldron_Cherney_and_Denton)/03%3A_The_Simplex_Method
    In such cases we are often interested in an optimal solution extremizing a particular quantity of interest. Questions like this are a focus of fields such as mathematical optimization and operations r...In such cases we are often interested in an optimal solution extremizing a particular quantity of interest. Questions like this are a focus of fields such as mathematical optimization and operations research. For the case where the functions involved are linear, these problems go under the title linear programming. Gigantic computers are dedicated to implementing linear programming methods such as George Dantzig’s simplex algorithm–the topic of this chapter.

Support Center

How can we help?