Identifying the set of always-active constraints in a system of linear inequalities by a single linear program
RePEc: Research Papers in EconomicsPublished 1 January 1985
Robert M. Freund, R. Roundy, Michael J. Todd
Citations46
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The interest lies in identifying the set of always-active constraints of Ax b by solving one linear program generated from the data by identifying Aix = b i.
Abstract
HD28 .M414 no.1674-, 85,
Keywords
Computer ScienceMathematicsEngineering
COMBINATORICAA new polynomial-time algorithm for linear programming
4,840 Citations1984Narendra Karmarkar