Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 4 - Sensitivity Analysis and Duality

  • David C. Vella, Skidmore College, New York
  • Book:
    Invitation to Linear Programming and Game Theory
    Published online:
    11 March 2021
    Print publication:
    11 March 2021, pp 148-184

  • Summary

    In this chapter, we introduce sensitivity analysis in linear programming. That is, we study the effect on the optimal solution that small changes in the statement in the problem entail. We consider changes in the objective function coefficients and changes in the constraint inequalities (which are often determined by supplies of raw materials in real life problems). The latter changes are closely tied with the notion of marginal values (shadow prices), which we also introduce and compute. We define and compute stable ranges of the values of a parameter where certain features of the solution remain unchanged. Finally, we study duality, which fits here as a topic because the decision variables in the dual problem are the marginal values of the original problem.