Integer programming problems with inexact data: Exact and approximate solutions

DOI10.1007/BF02366621zbMath0858.90100MaRDI QIDQ1816012

N. V. Semenova, Ivan V. Sergienko

Publication date: 21 November 1996

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

decomposition approachinexact data

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (6)

Bilevel optimization problems of distribution of interbudgetary transfers under given limitations ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty ⋮ Boolean problem of sequential minimization of moduli of linear functions and stability theorems ⋮ Interval estimation of alternatives in decision-making problems ⋮ Stability radius of a lexicographic optimum of a vector problem of Boolean programming

Cites Work

• Solution of integer programming problems with inexact data
• Interval discrete programming
• The problem of linear programming with approximate data
• Solution and investigation of one class of inexact integer programming problems
• Technical Note—Exact Solutions of Inexact Linear Programs
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• On the problems of linear programming with integral coefficients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer programming problems with inexact data: Exact and approximate solutions