Simplex algorithm for continuous linear programs

Primary tabs

TITLE: Simplex algorithm for continuous linear programs

SPEAKER: Dr. Gideon Weiss


I will motivate continuous linear programs by describing a problem of finite horizon transient control of a multi-class queueing network. I will give the formulation of a separated continuous linear program with linear objective and right hand side, and its symmetric reverse time dual. I will describe the structure of the optimal solutions, in the case that measurable bounded solutions exist, and illustrate the simplex algorithm for its solution. Finally, I will discuss full duality, when impulse controls at time 0 are allowed.


  • Workflow Status: Published
  • Created By: Anita Race
  • Created: 10/12/2009
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


Target Audience

No target audience selected.