Redundancy in mathematical programming. A state-of-the-art survey
From MaRDI portal
Publication:585081
zbMath0524.90058MaRDI QIDQ585081
No author found.
Publication date: 1983
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90C99)
Related Items (57)
Geometry of optimal value functions with applications to redundancy in linear programming ⋮ The use of the optimal partition in a linear programming solution for postoptimal analysis ⋮ Survey of solved and open problems in the degeneracy phenomenon ⋮ Note on prime representations of convex polyhedral sets ⋮ Testing the definiteness of matrices on polyhedral cones ⋮ A constraint selection technique for a class of linear programs ⋮ Deriving constraints among argument sizes in logic programs ⋮ A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary ⋮ Investment evaluation based on the commerical scope. The production of natural gas ⋮ A new approach to the analysis of random methods for detecting necessary linear inequality constraints ⋮ Consistency, redundancy, and implied equalities in linear systems ⋮ Redundancy elimination with a lexicographic solved form ⋮ On linear inequality systems without strongly redundant constraints ⋮ Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Probabilistic algorithms for extreme point identification ⋮ Pattern search in the presence of degenerate linear constraints ⋮ Experiments with external pivoting ⋮ Constraint propagation, relational arithmetic in AI systems and mathematical programs ⋮ Constructing integer programming models by the predicate calculus ⋮ Minimax method of measuring productive efficiency ⋮ Using dual presolving reductions to reformulate cumulative constraints ⋮ The generalized test collection problem ⋮ On the best case performance of hit and run methods for detecting necessary constraints ⋮ A canonical form for generalized linear constraints ⋮ Determining the right-hand vectors of an irredundant linear inequality system ⋮ Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems. ⋮ Weakly redundant constraints and their impact on postoptimal analyses in LP ⋮ Constraint classification in mathematical programming ⋮ Hit-and-run algorithms for the identification of nonredundant linear inequalities ⋮ A computational study of redundancy in randomly generated polytopes ⋮ Probabilistic logic programming ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Separating support hyperplanes for a pair of convex polyhedral sets ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Robust preliminary analysis of large-scale linear model for optimal industrial investments ⋮ Generalized theorems for permanent basic and nonbasic variables ⋮ Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints ⋮ Fully piecewise linear vector optimization problems ⋮ Consequences of dropping nonessential objectives for the application of MCDM methods ⋮ Fourier-Motzkin elimination method in MOLP problems ⋮ A complete algorithm for linear fractional programs ⋮ A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs ⋮ Analysis of structure in fuzzy linear programs ⋮ Equivalences between data envelopment analysis and the theory of redundancy in linear systems ⋮ A constraint selection technique in limit analysis ⋮ Support prices of activities in linear programming1,2 ⋮ Redundancy in linear inequality system ⋮ Randomly generated polytopes for testing mathematical programming algorithms ⋮ Uniform saturation in linear inequality systems ⋮ Nonessential objectives within network approaches for MCDM ⋮ Asymptotics for the random coupon collector problem ⋮ A heuristic approach for identification of redundant constraints in linear programming models ⋮ The BPMPD interior point solver for convex quadratic problems ⋮ Selected bibliography on degeneracy ⋮ Degeneracy graphs: Theory and applications. An updated survey
This page was built for publication: Redundancy in mathematical programming. A state-of-the-art survey
