Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming

DOI10.1137/0319005MaRDI QIDQ3949592zbMATH OpenOpenAlexFDO

Authors A. F. Perold

Publication date 1981

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0319005

zbMATH Keywords

continuous-time linear programmingextreme pointsfull rank conditions

Mathematics Subject Classification ID

Linear programming (90C05) Programming in abstract spaces (90C48) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Model systems in control theory (93C99)

Cited in

(11)

• Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
• Optimality conditions and strong duality in abstract and continuous-time linear programming
• An extension of the simplex algorithm for semi-infinite linear programming
• Robust continuous linear programs
• Approximate solutions and error bounds for a class of continuous-time linear programming problems
• Continuous-time Programming
• Dynamic matching for real-time ride sharing
• scientific article; zbMATH DE number 2206640 (Why is no real title available?)
• The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems
• Inverse conic linear programs in Banach spaces
• A simplex based algorithm to solve separated continuous linear programs

This page was built for publication: Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3949592)