Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming

DOI10.1137/0319005zbMath0488.49019OpenAlexW2034421572MaRDI QIDQ3949592

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

extreme pointscontinuous-time linear programmingfull 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)

Related Items (11)

Inverse conic linear programs in Banach spaces ⋮ Approximate solutions and error bounds for a class of continuous-time linear programming problems ⋮ Dynamic Matching for Real-Time Ride Sharing ⋮ Optimality conditions and strong duality in abstract and continuous-time linear programming ⋮ A simplex based algorithm to solve separated continuous linear programs ⋮ Robust continuous linear programs ⋮ The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems ⋮ Continuous-time Programming ⋮ Unnamed Item ⋮ An extension of the simplex algorithm for semi-infinite linear programming ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

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