Pages that link to "Item:Q3949592"
From MaRDI portal
The following pages link to Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming (Q3949592):
Displaying 9 items.
- The difference between finite dimensional linear programming problems and infinite dimensional linear programming problems (Q678712) (← links)
- Inverse conic linear programs in Banach spaces (Q828644) (← links)
- A simplex based algorithm to solve separated continuous linear programs (Q930346) (← links)
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming (Q1074501) (← links)
- Optimality conditions and strong duality in abstract and continuous-time linear programming (Q1166103) (← links)
- An extension of the simplex algorithm for semi-infinite linear programming (Q1824547) (← links)
- Robust continuous linear programs (Q2228355) (← links)
- Approximate solutions and error bounds for a class of continuous-time linear programming problems (Q3225076) (← links)
- Dynamic Matching for Real-Time Ride Sharing (Q5119412) (← links)
