Pages that link to "Item:Q585081"

The following pages link to Redundancy in mathematical programming. A state-of-the-art survey (Q585081):

Displayed 50 items.

• A heuristic algorithm for resource allocation/reallocation problem (Q410767) ‎ (← links)
• Using dual presolving reductions to reformulate cumulative constraints (Q487651) ‎ (← links)
• A comparative study of redundant constraints identification methods in linear programming problems (Q624719) ‎ (← links)
• Constraint classification in mathematical programming (Q689150) ‎ (← links)
• Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) ‎ (← links)
• A complete algorithm for linear fractional programs (Q749455) ‎ (← links)
• Experiments with external pivoting (Q909578) ‎ (← links)
• Constraint propagation, relational arithmetic in AI systems and mathematical programs (Q918408) ‎ (← links)
• Constructing integer programming models by the predicate calculus (Q918417) ‎ (← links)
• Survey of solved and open problems in the degeneracy phenomenon (Q1101009) ‎ (← links)
• Note on prime representations of convex polyhedral sets (Q1102183) ‎ (← links)
• Testing the definiteness of matrices on polyhedral cones (Q1104045) ‎ (← links)
• A constraint selection technique for a class of linear programs (Q1105487) ‎ (← links)
• A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (Q1106721) ‎ (← links)
• A new approach to the analysis of random methods for detecting necessary linear inequality constraints (Q1123120) ‎ (← links)
• On linear inequality systems without strongly redundant constraints (Q1130083) ‎ (← links)
• On the best case performance of hit and run methods for detecting necessary constraints (Q1186280) ‎ (← links)
• A canonical form for generalized linear constraints (Q1186697) ‎ (← links)
• Weakly redundant constraints and their impact on postoptimal analyses in LP (Q1199513) ‎ (← links)
• A computational study of redundancy in randomly generated polytopes (Q1207047) ‎ (← links)
• Probabilistic logic programming (Q1207942) ‎ (← links)
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs (Q1266607) ‎ (← links)
• Equivalences between data envelopment analysis and the theory of redundancy in linear systems (Q1278931) ‎ (← links)
• Asymptotics for the random coupon collector problem (Q1298487) ‎ (← links)
• Selected bibliography on degeneracy (Q1312748) ‎ (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) ‎ (← links)
• Geometry of optimal value functions with applications to redundancy in linear programming (Q1331104) ‎ (← links)
• The use of the optimal partition in a linear programming solution for postoptimal analysis (Q1342079) ‎ (← links)
• Deriving constraints among argument sizes in logic programs (Q1360682) ‎ (← links)
• Consistency, redundancy, and implied equalities in linear systems (Q1380438) ‎ (← links)
• Redundancy elimination with a lexicographic solved form (Q1380440) ‎ (← links)
• Consequences of dropping nonessential objectives for the application of MCDM methods (Q1806739) ‎ (← links)
• Analysis of structure in fuzzy linear programs (Q1814624) ‎ (← links)
• A constraint selection technique in limit analysis (Q1823877) ‎ (← links)
• Investment evaluation based on the commerical scope. The production of natural gas (Q1904680) ‎ (← links)
• The generalized test collection problem (Q1979174) ‎ (← links)
• Fully piecewise linear vector optimization problems (Q2046692) ‎ (← links)
• Robust preliminary analysis of large-scale linear model for optimal industrial investments (Q2271503) ‎ (← links)
• Determining the right-hand vectors of an irredundant linear inequality system (Q2466585) ‎ (← links)
• Analysis of hybrid heuristic model reduction algorithms for solving linear programming problems. (Q2467862) ‎ (← links)
• Uniform saturation in linear inequality systems (Q2568606) ‎ (← links)
• Nonessential objectives within network approaches for MCDM (Q2569051) ‎ (← links)
• Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) ‎ (← links)
• Random Procedures for Nonredundant Constraint Identification in Stochastic Linear Programs (Q3217951) ‎ (← links)
• A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) ‎ (← links)
• Probabilistic algorithms for extreme point identification (Q3508860) ‎ (← links)
• Pattern search in the presence of degenerate linear constraints (Q3514838) ‎ (← links)
• Randomly generated polytopes for testing mathematical programming algorithms (Q3664841) ‎ (← links)
• Minimax method of measuring productive efficiency (Q3807837) ‎ (← links)
• Redundancy in linear inequality system (Q4210734) ‎ (← links)