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)


65K05: Numerical mathematical programming methods

90C05: Linear programming

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

90C99: Mathematical programming


Related Items

On a calculation of an arbitrary separating hyperplane of convex polyhedral sets, Separating support hyperplanes for a pair of convex polyhedral sets, The BPMPD interior point solver for convex quadratic problems, Fourier-Motzkin elimination method in MOLP problems, Support prices of activities in linear programming1,2, Generalized theorems for permanent basic and nonbasic variables, Constraint classification in mathematical programming, A complete algorithm for linear fractional programs, Experiments with external pivoting, Constraint propagation, relational arithmetic in AI systems and mathematical programs, Constructing integer programming models by the predicate calculus, 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, A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary, A new approach to the analysis of random methods for detecting necessary linear inequality constraints, On linear inequality systems without strongly redundant constraints, On the best case performance of hit and run methods for detecting necessary constraints, A canonical form for generalized linear constraints, Weakly redundant constraints and their impact on postoptimal analyses in LP, A computational study of redundancy in randomly generated polytopes, Probabilistic logic programming, A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs, Equivalences between data envelopment analysis and the theory of redundancy in linear systems, Asymptotics for the random coupon collector problem, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, 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, Deriving constraints among argument sizes in logic programs, Consistency, redundancy, and implied equalities in linear systems, Redundancy elimination with a lexicographic solved form, Consequences of dropping nonessential objectives for the application of MCDM methods, Analysis of structure in fuzzy linear programs, A constraint selection technique in limit analysis, Investment evaluation based on the commerical scope. The production of natural gas, Robust preliminary analysis of large-scale linear model for optimal industrial investments, Determining the right-hand vectors of an irredundant linear inequality system, Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems., Uniform saturation in linear inequality systems, Nonessential objectives within network approaches for MCDM, Hit-and-run algorithms for the identification of nonredundant linear inequalities, Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs, A heuristic approach for identification of redundant constraints in linear programming models, Probabilistic algorithms for extreme point identification, Pattern search in the presence of degenerate linear constraints, Randomly generated polytopes for testing mathematical programming algorithms, Minimax method of measuring productive efficiency, Redundancy in linear inequality system