A COMPUTATIONAL METHOD FOR ALL-INTEGER INTERVAL LINEAR PROGRAMMING

DOI10.15807/JORSJ.28.87zbMATH Open0577.90052OpenAlexW2725620430MaRDI QIDQ3698643FDOQ3698643

Authors Teruo Sunaga, Alfonso J. Hayakawa M., Yuji Maruki

Publication date 1985

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.28.87

zbMATH Keywords

test problemsinterval linear programmingfractional cutting plane procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10) Interval and finite arithmetic (65G30)

Recommendations

• scientific article; zbMATH DE number 4043607
• Linear programming with interval arithmetic
• A note on integer solutions to linear fractional interval programming problems by a branch & bound technique
• scientific article; zbMATH DE number 2068450
• A modified two-step method for solving interval linear programming problems

Cited in

(5)

• scientific article; zbMATH DE number 4043607 (Why is no real title available?)
• New technique for solving primal all-integer linear programming
• One approach to solving a discrete production planning problem with interval data
• Finding all solution sets of piecewise-linear interval equations using an integer programming solver
• scientific article; zbMATH DE number 3974726 (Why is no real title available?)

This page was built for publication: A COMPUTATIONAL METHOD FOR ALL-INTEGER INTERVAL LINEAR PROGRAMMING

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