The dual linear program is
(1)
For feasible , nonnegativity and the two constraint inequalities imply weak duality:
(2)
If a feasible pair has equal objectives, every primal feasible objective is at most that common value and every dual feasible objective at least it. Thus both feasible solutions are optimal. Strong duality is not needed for this certificate.

Ancestors (12)

  1. 1
  2. T
  3. 2008
  4. Past exam of the probability, statistics and options I course of the University of Oxford
  5. Probability, statistics and options I course of the University of Oxford
  6. Year 2 of the mathematics and statistics course of the University of Oxford
  7. Mathematics and statistics course of the University of Oxford
  8. Undergraduate course of the University of Oxford
  9. Course of the University of Oxford
  10. University of Oxford
  11. List of universities
  12. Home

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version