Unboundedness in Integer and Discrete Programming L.P. Relaxations

DOI10.2307/3009435MaRDI QIDQ3854932zbMATH OpenOpenAlexFDO

Authors Robert Daniel, Martyn Jeffreys

Publication date 1979

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3009435

zbMATH Keywords

general mixed integer linear programminglinear programming relaxationunboundedness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Specification and verification (program logics, model checking, etc.) (68Q60) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10) Mixed integer programming (90C11)

This page was built for publication: Unboundedness in Integer and Discrete Programming L.P. Relaxations

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