NobleBlocks

Research indexJournal article

A Shadow Simplex Method for Infinite Linear Programs

Ghate, Sharma, Smith

Operations Research30 Dec 2009

NobleIDark:/48914/w1/20260522/5962EEB5DOI10.1287/opre.1090.0755

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

We present a simplex-type algorithm—that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another, not necessarily adjacent, extreme point—for solving a class of linear programs with countably infinite variables and constraints. Each iteration of this method can be implemented in finite time, whereas the solution values converge to the optimal value as the number of iterations increases. This simplex-type algorithm moves to an adjacent extreme point and hence reduces to a true infinite-dimensional simplex method for the important special cases of nonstationary infinite-horizon deterministic and stochastic dynamic programs.

Discussion

Citations

Topics

More

Suggest a correction or report