Pages that link to "Item:Q1193520"
From MaRDI portal
The following pages link to A geometric view of parametric linear programming (Q1193520):
Displaying 39 items.
- Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization (Q463718) (← links)
- A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
- Geometric algorithm for multiparametric linear programming (Q597202) (← links)
- Some properties of multiple parameters linear programming (Q607937) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Unifying optimal partition approach to sensitivity analysis in conic optimization (Q702383) (← links)
- Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm (Q868125) (← links)
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients (Q877589) (← links)
- Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (Q940836) (← links)
- Active constraint set invariancy sensitivity analysis in linear optimization (Q946305) (← links)
- Partitioning multiple objective optimal solutions with applications in radiotherapy design (Q1027150) (← links)
- Sensitivity analysis in linear programming: Just be careful! (Q1278928) (← links)
- On parametric semidefinite programming (Q1294552) (← links)
- Degeneracy in interior point methods for linear programming: A survey (Q1312753) (← links)
- Finding an interior point in the optimal face of linear programs (Q1319020) (← links)
- The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) (← links)
- Consistency, redundancy, and implied equalities in linear systems (Q1380438) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Multiparametric demand transportation problem (Q1604061) (← links)
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method (Q1610185) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- Sensitivity analysis of the optimal assignment. (Q1811143) (← links)
- Experimental investigations in combining primal dual interior point method and simplex based LP solvers (Q1904702) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods (Q1919814) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- Scheduling divisible loads with time and cost constraints (Q2066693) (← links)
- Two optimal value functions in parametric conic linear programming (Q2139272) (← links)
- On the sensitivity of the optimal partition for parametric second-order conic optimization (Q2230950) (← links)
- Sensitivity analysis in linear optimization: invariant support set intervals (Q2572886) (← links)
- A STUDY ON SENSITIVITY ANALYSIS FOR CONVEX QUADRATIC PROGRAMS (Q3421859) (← links)
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM (Q3439887) (← links)
- Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
- Envelope Theorems for Multistage Linear Stochastic Optimization (Q5031649) (← links)
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs (Q5060524) (← links)
- Probability Distributions on Partially Ordered Sets and Network Interdiction Games (Q5076709) (← links)
- A new interval diagnosis method: Application to the spacecraft rendezvous phase of the Mars sample return mission (Q5128875) (← links)
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization (Q5870362) (← links)
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)