An observation on the structure of production sets with indivisibilities
AUTOR(ES)
Scarf, Herbert E.
RESUMO
A subset of the constraints of an integer programming problem is said to be binding if, when the remaining constraints are eliminated, the smaller problem has the same optimal solution as the original problem. It is shown that an integer programming problem with n variables has a set of binding constraints of cardinality less than or equal to 2n-1. The bound is sharp.
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=431672Documentos Relacionados
- Homocystinuria: an observation on the inheritance of cystathionine synthase deficiency.
- Repeated observation of breast tumor subtypes in independent gene expression data sets
- ON EQUATIONS WITH SETS AS UNKNOWNS
- ON POWER SERIES WITH UNBOUNDED CLUSTER SETS, AND FUNCTIONS OF CLASS H2 WITH MEAGER SETS OF RADIAL CONTINUITY
- AN ELEMENTARY THEORY OF THE CATEGORY OF SETS*
