A simplex based algorithm to solve separated continuous linear programs
From MaRDI portal
Publication:930346
DOI10.1007/S10107-008-0217-XzbMATH Open1165.90011OpenAlexW1987611686MaRDI QIDQ930346FDOQ930346
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
Recommendations
Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear optimal control problems (49N05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extended algorithm for separated continuous linear programs
- On duality theory of conic linear problems.
- Title not available (Why is that?)
- An Algorithm for 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
- Title not available (Why is that?)
- A Duality Theory for Separated Continuous Linear Programs
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Criss-cross methods: A fresh view on pivot algorithms
- Optimal dynamic routing in communication networks with continuous traffic
- A new continuous model for job-shop scheduling
- Bottleneck Problems and Dynamic Programming
- A continuous-time network simplex algorithm
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- Existence and duality theory for separated continuous linear programs
- An adaptive discretization algorithm for a class of continuous network programs
- Quickest Flows Over Time
- Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
- Title not available (Why is that?)
- Symmetric Duality for Continuous Linear Programs
- Inexact primal-dual interior point iteration for linear programs in function spaces
- An alternative method for a global analysis of quadratic programs in a finite number of steps
Cited In (39)
- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- Time-Varying Semidefinite Programs
- Continuity and monotonicity of solutions to a greedy maximization problem
- Parametric continuous-time linear fractional programming problems
- Inverse conic linear programs in Banach spaces
- Fluid analysis of an input control problem
- Robust continuous linear programs
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- An extended algorithm for separated continuous linear programs
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Near optimal control of queueing networks over a finite time horizon
- Continuous-time linear programming problems revisited: A perturbation approach
- Flows over time in time-varying networks: optimality conditions and strong duality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boundary-influenced robust controls: two network examples
- Review on the research for separated continuous linear programming: with applications on service operations
- A constant rank constraint qualification in continuous-time nonlinear programming
- Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions
- Improving the performance of modular production in the apparel assembly: a mathematical programming approach
- Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
- Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- On solving continuous-time dynamic network flows
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Structure of Solutions for Continuous Linear Programs with Constant Coefficients
- A simplex-type algorithm for continuous linear programs with constant coefficients
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
- An Algorithm for a Class of Continuous Linear Programs
- Solving the drift control problem
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- An algorithm for the maximum revenue jobshop problem
- Scheduling for a processor sharing system with linear slowdown
- Stochastic separated continuous conic programming: strong duality and a solution method
- Dynamic Matching for Real-Time Ride Sharing
Uses Software
This page was built for publication: A simplex based algorithm to solve separated continuous linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930346)
