Uniqueness of solution in linear programming

Cites work

A Characterization of Stability in Linear Programming
scientific article; zbMATH DE number 3177183 (Why is no real title available?)
scientific article; zbMATH DE number 3307153 (Why is no real title available?)
scientific article; zbMATH DE number 3308846 (Why is no real title available?)
Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
Stability Theory for Systems of Inequalities. Part I: Linear Systems

Cited in

(48)

Geometric and algorithmic developments for a hierarchical planning problem
A computable convex programming characterization of optimal interpolatory quadratic splines with free knots
Implementing proximal point methods for linear programming
A direct approach for finding all efficient solutions for multiobjective programming problems
Optimal simplex tableau characterization of unique and bounded solutions of linear programs
A stable theorem of the alternative: An extension of the Gordan theorem
Description of the optimal solution set of the linear programming problem and the dimension formula
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
Conditions for the uniqueness of the optimal solution in linear semi- infinite programming
Bilevel programming and applications
Robust and Pareto optimality of insurance contracts
Uniqueness of KKT multipliers in multiobjective optimization.
Optimality criteria in \(E\)-convex programming
Unicity in linear optimization
Second order of stochastic dominance efficiency vs mean variance efficiency
An enhanced branch-and-bound algorithm for bilevel integer linear programming
On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
Bayesian persuasion in unlinked games
Negative selection -- a new performance measure for automated order execution
Probability of unique integer solution to a system of linear equations
Asymptotic optimality of maximum pressure policies in stochastic processing networks
On the structure of the inverse-feasible region of a linear program
On the uniqueness of optimal strategies in symmetric matrix games
A decomposition method for large scale MILPs, with performance guarantees and a power system application
Computing shadow prices with multiple Lagrange multipliers
Quadratic surface support vector machine with L1 norm regularization
Convex cardinal shape composition
Concurrent estimation of efficiency, effectiveness and returns to scale
On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
A nonlinear equation for linear programming
Exact penalty functions in nonlinear programming
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
Efficient methods for selfish network design
On stable uniqueness in linear semi-infinite optimization
Modelling the bid and ask prices of illiquid CDSs
Selfish splittable flows and NP-completeness
Support prices of activities in linear programming¹,²
Quantile inverse optimization: improving stability in inverse linear programming
Solution uniqueness of convex piecewise affine functions based optimization with applications to constrained _1 minimization
Privacy aware learning
Uniqueness of solution in FLP under parameter perturbations
Uniqueness of integer solution of linear equations
Efficient joint object matching via linear programming
Generalized derivatives of optimal-value functions with parameterized convex programs embedded
Characteristic sets and characteristic numbers of matrix two-person games
Weight-ranked divide-and-conquer contracts
On solution uniqueness and robust recovery for sparse regularization with a gauge: from dual point of view
Uniqueness and multiplicity of market equilibria on DC power flow networks

This page was built for publication: Uniqueness of solution in linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254945)