Pages that link to "Item:Q930346"

The following pages link to A simplex based algorithm to solve separated continuous linear programs (Q930346):

Displaying 33 items.

• Parametric continuous-time linear fractional programming problems (Q265125) (← links)
• Using the parametric approach to solve the continuous-time linear fractional Max-min problems (Q445341) (← links)
• On solving continuous-time dynamic network flows (Q453631) (← links)
• Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
• An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693) (← links)
• Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously (Q553382) (← links)
• Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems (Q625648) (← links)
• Inverse conic linear programs in Banach spaces (Q828644) (← links)
• A constant rank constraint qualification in continuous-time nonlinear programming (Q829874) (← links)
• Fluid analysis of an input control problem (Q833093) (← links)
• Near optimal control of queueing networks over a finite time horizon (Q839876) (← links)
• An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
• Improving the performance of modular production in the apparel assembly: a mathematical programming approach (Q1718464) (← links)
• Stochastic separated continuous conic programming: strong duality and a solution method (Q1719330) (← links)
• Continuous-time generalized fractional programming problems. II: an interval-type computational procedure (Q1949580) (← links)
• Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions (Q2132131) (← links)
• Continuity and monotonicity of solutions to a greedy maximization problem (Q2216174) (← links)
• Robust continuous linear programs (Q2228355) (← links)
• Flows over time in time-varying networks: optimality conditions and strong duality (Q2253989) (← links)
• A simplex-type algorithm for continuous linear programs with constant coefficients (Q2297646) (← links)
• Scheduling for a processor sharing system with linear slowdown (Q2408895) (← links)
• Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions (Q2829611) (← links)
• Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems (Q2881894) (← links)
• Approximate solutions and error bounds for a class of continuous-time linear programming problems (Q3225076) (← links)
• Boundary-influenced robust controls: two network examples (Q3416756) (← links)
• Solving the drift control problem (Q3466714) (← links)
• A simplex algorithm for minimum-cost network-flow problems in infinite networks (Q3632966) (← links)
• Continuous-time linear programming problems revisited: A perturbation approach (Q4916307) (← links)
• Time-Varying Semidefinite Programs (Q4958555) (← links)
• Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks (Q5026449) (← links)
• Dynamic Matching for Real-Time Ride Sharing (Q5119412) (← links)
• (Q5214773) (← links)
• Structure of Solutions for Continuous Linear Programs with Constant Coefficients (Q5501227) (← links)