A recurrence method for a special class of continuous time linear programming problems

DOI10.1007/s10898-009-9459-2zbMath1220.90156MaRDI QIDQ969744

Ching-Feng Wen, Yung-Yih Lur, Yan-Kuen Wu

Publication date: 7 May 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-009-9459-2

zbMATH Keywords

continuous time linear programming problems; infinite-dimensional linear programming problems

Mathematics Subject Classification ID

90C05: Linear programming

90C39: Dynamic programming

Related Items

Continuous-time generalized fractional programming problems. Part I: Basic theory, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, Continuous-time generalized fractional programming problems. II: an interval-type computational procedure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the form of solutions to the linear continuous time programming problem and a conjecture by Tyndall
• An extended algorithm for separated continuous linear programs
• A class of continuous linear programming problems
• Continuous programming. I: Linear objectives
• A new continuous model for job-shop scheduling
• An alternative method for a global analysis of quadratic programs in a finite number of steps
• Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
• An Extended Duality Theorem for Continuous Linear Programming Problems
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• Symmetric Duality for Continuous Linear Programs
• Numerical solutions to continuous linear programming problems