Zur Identifikation redundanter Nebenbedingungen in linearen Programmen

DOI10.1007/BF01958597zbMath0295.90026MaRDI QIDQ4048846

No author found.

Publication date: 1975

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (8)

Minimal representation of convex polyhedral sets ⋮ A Calculation of all Separating Hyperplanes of two Convex Polytopes ⋮ Weakly redundant constraints and their impact on postoptimal analyses in LP ⋮ Hit-and-run algorithms for the identification of nonredundant linear inequalities ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Separating support hyperplanes for a pair of convex polyhedral sets ⋮ OnR.W. Llewellyn's rules to identify redundant constraints: A detailed critique and some generalizations ⋮ A general method for determining the set of all efficient solutions to a linear vectormaximum problem

Cites Work

• Unnamed Item
• On Trivial and Binding Constraints in Programming Problems
• A Note on Redundancy and Linear Parametric Programming
• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• A method for solving maximum-problems with a nonconcave quadratic objective function
• Redundante Ungleichungen bei linearen Ungleichungssystemen
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities

This page was built for publication: Zur Identifikation redundanter Nebenbedingungen in linearen Programmen