Duality: Difference between revisions
Jump to navigation
Jump to search
LockheedELDP (talk | contribs) No edit summary |
LockheedELDP (talk | contribs) |
||
| Line 9: | Line 9: | ||
== Theory, methodology, and/or algorithmic discussions == | == Theory, methodology, and/or algorithmic discussions == | ||
=== Definition: === | |||
'''Primal''' | |||
maximize <math>z=\textstyle \sum_{j=1}^n \displaystyle c_j x_j</math> | |||
subject to: | |||
Dual | |||
== Numerical Example == | == Numerical Example == | ||
Revision as of 18:04, 7 November 2020
Author: Claire Gauthier, Trent Melsheimer, Alexa Piper, Nicholas Chung, Michael Kulbacki (SysEn 6800 Fall 2020)
Steward: TA's name, Fengqi You
Introduction
Every linear programming optimization problem may be viewed either from the primal or the dual, this is the principal of duality. Duality develops the relationships between one linear programming problem and another related linear programming problem. For example in economics, if the primal optimization problem deals with production and consumption levels, then the dual of that problem relates to the prices of goods and services. The dual variables in this example can be referred to as shadow prices.
The shadow price of a constraint ...
Theory, methodology, and/or algorithmic discussions
Definition:
Primal
maximize
subject to:
Dual