Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions

DOI10.3934/math.2020358zbMath1484.90043OpenAlexW3038583616MaRDI QIDQ2132131

Hsien-Chung Wu

Publication date: 27 April 2022

Published in: AIMS Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/math.2020358

zbMATH Keywords

piecewise continuous functionsstrong duality theoremcontinuous-time linear programming problemsdiscretized problemsweak duality theorem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Using the parametric approach to solve the continuous-time linear fractional Max-min problems
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
• A simplex based algorithm to solve separated continuous linear programs
• 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
• Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
• 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
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
• On a Dynamic Programming Approach to the Caterer Problem—I
• Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions
• Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
• Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
• Some Properties of a Class of Continuous Linear Programs
• Duality for a class of continuous-time homogeneous fractional programming problems
• 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
• Structure of Solutions for Continuous Linear Programs with Constant Coefficients
• An Extended Duality Theorem for Continuous Linear Programming Problems
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• Numerical solutions to continuous linear programming problems

This page was built for publication: Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions