Pages that link to "Item:Q4883650"
From MaRDI portal
The following pages link to A Duality Theory for Separated Continuous Linear Programs (Q4883650):
Displaying 32 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)
- Review on the research for separated continuous linear programming: with applications on service operations (Q459903) (← links)
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems (Q625648) (← links)
- A review of duality theory for linear programming over topological vector spaces (Q791861) (← links)
- Inverse conic linear programs in Banach spaces (Q828644) (← links)
- Continuous-time optimization problems involving invex functions (Q860670) (← links)
- A simplex based algorithm to solve separated continuous linear programs (Q930346) (← links)
- Duality in continuous-time homogeneous programming (Q1066813) (← links)
- On duality and the maximum principle for continuous linear programming problems (Q1072942) (← links)
- Some remarks concerning duality for continuous-time programming problems (Q1084028) (← links)
- Large-deviations analysis of the fluid approximation for a controllable tandem queue (Q1429111) (← links)
- Stochastic separated continuous conic programming: strong duality and a solution method (Q1719330) (← links)
- Managing high-end ex-demonstration product returns (Q1735182) (← links)
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality. (Q1872498) (← links)
- Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions (Q1933386) (← links)
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions (Q2132131) (← 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)
- 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)
- A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems (Q3174805) (← links)
- (Q3489786) (← 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)
- Technical Note—Closed-Form Solutions for Worst-Case Law Invariant Risk Measures with Application to Robust Portfolio Optimization (Q5131536) (← links)
- (Q5214773) (← links)
- Structure of Solutions for Continuous Linear Programs with Constant Coefficients (Q5501227) (← links)
- Nonsmooth continuous-time optimization problems: Necessary conditions (Q5948800) (← links)