A Characterization of Stability in Linear Programming
From MaRDI portal
Publication:4152336
DOI10.1287/opre.25.3.435zbMath0373.90045OpenAlexW2145778743MaRDI QIDQ4152336
Publication date: 1977
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.25.3.435
Related Items
Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts, Upper semicontinuity of the solution maps in homogeneous vector quasi-equilibrium problems, Extreme points of well-posed polytopes, The equivalence of upper semi-continuity of the solution map and the \(R_{0}\)-condition in the mixed linear complementarity problem, Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming, A Variable-Complexity Norm Maximization Problem, Input optimization: I. Optimal realizations of mathematical models, A characterization of lower semicontinuity of constraint sets, Continuity of the solution map in parametric affine variational inequalities, The simplex method is not always well behaved, Limit laws for empirical optimal solutions in random linear programs, Characterizations of stability of error bounds for convex inequality constraint systems, Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems, Least-norm linear programming solution as an unconstrained minimization problem, Stability of linearly constrained convex quadratic programs, About error bounds in metrizable topological vector spaces, Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs, Round-off estimates for second-order conic feasibility problems, Unnamed Item, Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities, An algorithm for approximate multiparametric linear programming, Critical objective size and calmness modulus in linear programming, The concept of proper solution in linear programming, Resampling DEA estimates of investment fund performance, Sufficient conditions for the stability of the karush- kuhn - tucker point set in quadratic programming, From data to model and back to data: A bond portfolio management problem, Solving linear programs with finite precision. II: Algorithms, Ill-posedness with respect to the solvability in linear optimization, Saddle point approximation approaches for two-stage robust optimization problems, A condition number theorem in convex programming, Uniqueness of solution in linear programming, Some concepts of stability analysis in combinatorial optimization, Quantitative Stability Analysis of Two-Stage Stochastic Linear Programs with Full Random Recourse, Uncertainties in minimax stochastic programs, Condition measures and properties of the central trajectory of a linear program, Stability of the extreme point set of a polyhedron, Stable monotone variational inequalities
