Characterizing extreme points as basic feasible solutions in infinite linear programs

DOI10.1016/j.orl.2008.09.002zbMath1154.90541OpenAlexW2047062244MaRDI QIDQ1002074

Archis Ghate, Robert L. Smith

Publication date: 23 February 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.09.002

zbMATH Keywords

non-stationary Markov decision processesinfinite network flow problemsstrictly positive support

Mathematics Subject Classification ID

Linear programming (90C05) Stochastic network models in operations research (90B15) Markov renewal processes, semi-Markov processes (60K15)

Related Items (6)

A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems ⋮ Inverse optimization in semi-infinite linear programs ⋮ Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space ⋮ On packing and covering polyhedra in infinite dimensions ⋮ A Simplex Method for Countably Infinite Linear Programs ⋮ A dual scheme for solving linear countable semi-infinite fractional programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Extreme point characterizations for infinite network flow problems

This page was built for publication: Characterizing extreme points as basic feasible solutions in infinite linear programs