What is ... the Lagrangian relaxation of an integer program?

This page hosts information on Jonad Pulaj's talk "What is ... the Lagrangian relaxation of an integer program?" at the "What is ...?" seminar. The talk will take place on Friday, November 25, 4:00pm at the BMS Lounge in TU, MA 212.

Abstract

The Lagrangian relaxation is a well known technique which provides bounds for integer programs through penalty adjustments. We give an overview of the method and illustrate its application to multi-period network design.

Comments

 
Topic revision: r1 - 21 Nov 2011, MimiTsuruga
 
  • Printable version of this topic (p) Printable version of this topic (p)