The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems

DOI10.1006/jmaa.1997.5279zbMath0876.90067OpenAlexW2091655029MaRDI QIDQ678712

Tvu-Ying Ho, Yuung-Yih Lur, Soon-Yi Wu

Publication date: 1 December 1997

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1997.5279

zbMATH Keywords

infinite-dimensional linear programmingfinite-dimensional linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous programming. I: Linear objectives
• Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
• An Algorithm for a Class of Continuous Linear Programs
• On the Solutions of a Class of Continuous Linear Programs
• A Duality Theorem for a Class of Continuous Linear Programming Problems

This page was built for publication: The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems