A constraint selection technique for a class of linear programs

DOI10.1016/0167-6377(88)90027-2zbMATH Open0648.90053OpenAlexW2066907087MaRDI QIDQ1105487FDOQ1105487

Authors: Danny C. Meyers, Wei Shih 

Publication date: 1988

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(88)90027-2

Recommendations

• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
• A heuristic approach for identification of redundant constraints in linear programming models
• Constraint Reduction for Linear Programs with Many Inequality Constraints
• A simplex method based on reducing the constraint conditions of linear programming

zbMATH Keywords

heuristicconstraint selectionbinding constraints identification

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• Finding duplicate rows in a linear programming model
• Redundancy in mathematical programming. A state-of-the-art survey
• A note on detecting simple redundancies in linear systems
• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• On trivial and binding constraints in programming problems
• The pivot and probe algorithm for solving a linear program
• Some Properties of Redundant Constraints and Extraneous Variables in Direct and Dual Linear Programming Problems

Cited In (12)

• A constraint selection technique in limit analysis
• A Dual Simplex Implementation of a Constraint Selection Algorithm for Linear Programming
• A fast method for a class of one-stage bounded variables and single constrained linear programming problems
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
• The transformation technique for a class of variable upper bounding constraints in linear programming
• A comparative study of redundant constraints identification methods in linear programming problems
• A heuristic approach for identification of redundant constraints in linear programming models
• Title not available (Why is that?)
• Technical Note—On the Weighted Selection Algorithm for Certain Linear Programs with Nested Constraint Coefficients
• Title not available (Why is that?)
• A Weighted Selection Algorithm for Certain Tree-Structured Linear Programs
• Title not available (Why is that?)

This page was built for publication: A constraint selection technique for a class of linear programs

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