A simplex based algorithm to solve separated continuous linear programs
From MaRDI portal
Publication:930346
DOI10.1007/s10107-008-0217-xzbMath1165.90011OpenAlexW1987611686MaRDI QIDQ930346
Publication date: 30 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0217-x
Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear optimal control problems (49N05)
Related Items (33)
Parametric continuous-time linear fractional programming problems ⋮ Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems ⋮ Inverse conic linear programs in Banach spaces ⋮ A constant rank constraint qualification in continuous-time nonlinear programming ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Fluid analysis of an input control problem ⋮ Near optimal control of queueing networks over a finite time horizon ⋮ Unnamed Item ⋮ Scheduling for a processor sharing system with linear slowdown ⋮ Approximate solutions and error bounds for a class of continuous-time linear programming problems ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ Continuous-time generalized fractional programming problems. II: an interval-type computational procedure ⋮ Dynamic Matching for Real-Time Ride Sharing ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ On solving continuous-time dynamic network flows ⋮ Continuity and monotonicity of solutions to a greedy maximization problem ⋮ Improving the performance of modular production in the apparel assembly: a mathematical programming approach ⋮ Stochastic separated continuous conic programming: strong duality and a solution method ⋮ Robust continuous linear programs ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan ⋮ An algorithm for the maximum revenue jobshop problem ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously ⋮ Time-Varying Semidefinite Programs ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions ⋮ Boundary-influenced robust controls: two network examples ⋮ Structure of Solutions for Continuous Linear Programs with Constant Coefficients ⋮ Solving the drift control problem ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Criss-cross methods: A fresh view on pivot algorithms
- An extended algorithm for separated continuous linear programs
- Inexact primal-dual interior point iteration for linear programs in function spaces
- Optimal dynamic routing in communication networks with continuous traffic
- A continuous-time network simplex algorithm
- A new continuous model for job-shop scheduling
- Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
- An alternative method for a global analysis of quadratic programs in a finite number of steps
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- An Algorithm for a Class of Continuous Linear Programs
- Existence and duality theory for separated continuous linear programs
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network 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
- Quickest Flows Over Time
- Symmetric Duality for Continuous Linear Programs
- Bottleneck Problems and Dynamic Programming
This page was built for publication: A simplex based algorithm to solve separated continuous linear programs
