Polynomial Approximations for Continuous Linear Programs

Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude time discretization remains the method of c...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on optimization Vol. 22; no. 2; pp. 628 - 648
Main Authors:	Bampou, Dimitra, Kuhn, Daniel
Format:	Journal Article
Language:	English
Published:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Subjects:	Algorithms Approximation Linear programming Optimization Polynomials
ISSN:	1052-6234, 1095-7189
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!