Technical Note—Explicit Solutions of Interval Linear Programs

DOI10.1287/OPRE.21.1.390MaRDI QIDQ5681802zbMATH OpenOpenAlexFDO

Authors Sanjo Zlobec, Adi Ben-Israel

Publication date 1973

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.21.1.390

Mathematics Subject Classification ID

Linear programming (90C05)

Cited in

(6)

• Applications of generalized inverses to interval linear programs in hilbert spaces
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• Assessing the accuracy of externalities prediction in a LCFS-PR M/G/1 queue under partial information
• A suboptimization method for interval linear programming: A new method for linear programming
• Linear optimization with box constraints in Banach spaces
• Explicit solvability of dual pairs of infinite linear programs.

This page was built for publication: Technical Note—Explicit Solutions of Interval Linear Programs

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