# Difference between revisions of "Duality"

LockheedELDP (talk | contribs) |
LockheedELDP (talk | contribs) |
||

Line 27: | Line 27: | ||

== Numerical Example == | == Numerical Example == | ||

+ | maximize <math>z=6x_1+14x_2+13x_3</math> | ||

+ | |||

+ | subject to: | ||

+ | |||

+ | <math>\tfrac{1}{2}x_1+2x_2+x_3\leq 24</math> | ||

+ | |||

+ | <math>x_1</math> | ||

== Applications == | == Applications == |

## Revision as of 22:07, 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**

Minimize

subject to:

### Constructing a Dual:

## Numerical Example

maximize

subject to: