Continuous-time linear programming problems revisited: A perturbation approach

DOI10.1080/02331934.2010.548868zbMath1291.90133OpenAlexW2063433832MaRDI QIDQ4916307

Hsien-Chung Wu

Publication date: 22 April 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2010.548868

zbMATH Keywords

strong duality theoremcontinuous-time linear programming problemsdiscretized problemsweak duality theoremperturbed optimization problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (2)

Duality gap function in infinite dimensional linear programming ⋮ Note: continuous-time linear programming problems revisited

Cites Work

• A simplex based algorithm to solve separated continuous linear programs
• Sufficient optimality conditions in continuous-time nonlinear programming
• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
• Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
• Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
• Optimality conditions and duality in continuous programming. II: The linear problem revisited
• Optimality conditions and strong duality in abstract and continuous-time linear programming
• A class of infinite dimensional linear programming problems
• Continuous time programming with nonlinear constraints
• Saddle-point optimality criteria of continuous time programming without differentiability
• A sufficient optimality criterion in continuous time programming for generalized convex functions
• Nonsmooth continuous-time optimization problems: Sufficient conditions
• Continuous time programming with nonlinear time-delayed constraints
• An extended algorithm for separated continuous linear programs
• Optimality criteria for nonsmooth continuous-time problems of multiobjective optimization
• Duality for nonsmooth continuous-time problems of vector optimization
• A class of continuous linear programming problems
• A class of continuous convex programming problems
• Continuous programming. I: Linear objectives
• Continuous programming. II: Nonlinear objectives
• Duality in continuous linear programming
• Some Properties of a Class of Continuous Linear Programs
• An Algorithm for a Class of Continuous Linear Programs
• On the Solutions of a Class of Continuous Linear Programs
• Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
• Forms of Optimal Solutions for Separated Continuous Linear Programs
• A Duality Theory for Separated Continuous Linear Programs
• 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

This page was built for publication: Continuous-time linear programming problems revisited: A perturbation approach