A simplex based algorithm to solve separated continuous linear programs
From MaRDI portal
Recommendations
- An extended algorithm for separated continuous linear programs
- An Algorithm for a Class of Continuous Linear Programs
- Some Properties of a Class of Continuous Linear Programs
- scientific article; zbMATH DE number 4162659
- A simplex-type algorithm for continuous linear programs with constant coefficients
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4029251 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 786514 (Why is no real title available?)
- scientific article; zbMATH DE number 866106 (Why is no real title available?)
- scientific article; zbMATH DE number 3200250 (Why is no real title available?)
- A Duality Theory for Separated Continuous Linear Programs
- A New Algorithm for State-Constrained Separated Continuous Linear Programs
- A continuous-time network simplex algorithm
- A new continuous model for job-shop scheduling
- An Algorithm for a Class of Continuous Linear Programs
- An adaptive discretization algorithm for a class of continuous network programs
- An alternative method for a global analysis of quadratic programs in a finite number of steps
- An extended algorithm for separated continuous linear programs
- Bottleneck Problems and Dynamic Programming
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Criss-cross methods: A fresh view on pivot algorithms
- Efficient Algorithms for Separated Continuous Linear Programs: The Multicommodity Flow Problem with Holding Costs and Extensions
- Existence and duality theory for separated continuous linear programs
- Extreme Points and Basic Feasible Solutions in Continuous Time Linear Programming
- Forms of Optimal Solutions for Separated Continuous Linear Programs
- Inexact primal-dual interior point iteration for linear programs in function spaces
- On duality theory of conic linear problems.
- Optimal dynamic routing in communication networks with continuous traffic
- Quickest Flows Over Time
- Symmetric Duality for Continuous Linear Programs
Cited in
(39)- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- scientific article; zbMATH DE number 5022963 (Why is no real title available?)
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Robust continuous linear programs
- Flows over time in time-varying networks: optimality conditions and strong duality
- Near optimal control of queueing networks over a finite time horizon
- Structure of solutions for continuous linear programs with constant coefficients
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- A constant rank constraint qualification in continuous-time nonlinear programming
- Inverse conic linear programs in Banach spaces
- Fluid analysis of an input control problem
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- Improving the performance of modular production in the apparel assembly: a mathematical programming approach
- Solving the drift control problem
- An Algorithm for a Class of Continuous Linear Programs
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- A simplex-type algorithm for continuous linear programs with constant coefficients
- An extended algorithm for separated continuous linear programs
- Scheduling for a processor sharing system with linear slowdown
- 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
- Convergence of a General Class of Algorithms for Separated Continuous Linear Programs
- Stochastic separated continuous conic programming: strong duality and a solution method
- Dynamic matching for real-time ride sharing
- Time-Varying Semidefinite Programs
- Separated and state-constrained separated linear programming problems on time scales
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan
- Parametric continuous-time linear fractional programming problems
- Boundary-influenced robust controls: two network examples
- Continuity and monotonicity of solutions to a greedy maximization problem
- Solving continuous-time linear programming problems based on the piecewise continuous functions
- Continuous-time linear programming problems revisited: a perturbation approach
- An algorithm for the maximum revenue jobshop problem
- On solving continuous-time dynamic network flows
- scientific article; zbMATH DE number 4162659 (Why is no real title available?)
- Review on the research for separated continuous linear programming: with applications on service operations
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)
