A randomized algorithm for fixed-dimensional linear programming

A randomized algorithm for fixed-dimensional linear programming

0.00 Avg rating—0 Votes
Article ID: iaor1989714
Country: Netherlands
Volume: 44
Issue: 2
Start Page Number: 203
End Page Number: 212
Publication Date: Jun 1989
Journal: Mathematical Programming (Series A)
Authors: ,
Abstract:

The authors give a (Las Vegas) randomized algorithm for linear programming in a fixed dimension d for which the expected computation time is equ1, where equ2. This improves the corresponding worst-case complexity, equ3. The method is based on a recent idea of Clarkson. Two variations on the algorithm are examined briefly.

Reviews

Required fields are marked *. Your email address will not be published.