Zur Identifikation redundanter Nebenbedingungen in linearen Programmen

DOI10.1007/BF01958597zbMATH Open0295.90026MaRDI QIDQ4048846FDOQ4048846

Authors:

Publication date: 1975

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

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems
• An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities
• On trivial and binding constraints in programming problems
• A method for solving maximum-problems with a nonconcave quadratic objective function
• A Note on Redundancy and Linear Parametric Programming
• Redundante Ungleichungen bei linearen Ungleichungssystemen
• Title not available (Why is that?)

Cited In (8)

• Minimal representation of convex polyhedral sets
• A Calculation of all Separating Hyperplanes of two Convex Polytopes
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Separating support hyperplanes for a pair of convex polyhedral sets
• Weakly redundant constraints and their impact on postoptimal analyses in LP
• 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
• On a calculation of an arbitrary separating hyperplane of convex polyhedral sets

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

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