On trivial and binding constraints in programming problems

DOI10.1287/MNSC.8.4.419MaRDI QIDQ2778968zbMATH OpenOpenAlexFDO

Authors J. C. G. Boot

Publication date 22 October 2002

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.8.4.419

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited in

(14)

• General criteria for redundant and nonredundant linear inequalities
• 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
• Minimal representation of convex polyhedral sets
• Saturation in linear optimization
• An algorithm for set covering problem
• A constraint selection technique in limit analysis
• Uniform saturation in linear inequality systems
• Excess information in parametric linear optimization
• Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
• Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
• Redundante Ungleichungen bei linearen Ungleichungssystemen
• Nota sobre programacion lineal estocastica: Evolucion y estado actual. (I)
• A comparative study of redundant constraints identification methods in linear programming problems

This page was built for publication: On trivial and binding constraints in programming problems

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