Integer programming problems with inexact data: Exact and approximate solutions

DOI10.1007/BF02366621MaRDI QIDQ1816012zbMATH OpenFDO

Authors N. V. Semenova, I. 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)

Recommendations

• scientific article; zbMATH DE number 4087425
• Solution and investigation of one class of inexact integer programming problems
• scientific article; zbMATH DE number 4137543
• scientific article; zbMATH DE number 3892937
• Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty

Cites work

• scientific article; zbMATH DE number 4160467 (Why is no real title available?)
• scientific article; zbMATH DE number 4068618 (Why is no real title available?)
• scientific article; zbMATH DE number 4087425 (Why is no real title available?)
• scientific article; zbMATH DE number 3715310 (Why is no real title available?)
• scientific article; zbMATH DE number 3761783 (Why is no real title available?)
• scientific article; zbMATH DE number 3233383 (Why is no real title available?)
• Interval discrete programming
• On the problems of linear programming with integral coefficients
• Solution and investigation of one class of inexact integer programming problems
• Solution of integer programming problems with inexact data
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Technical Note—Exact Solutions of Inexact Linear Programs
• The problem of linear programming with approximate data

Cited in

(12)

• 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
• One approach to solving a discrete production planning problem with interval data
• Stability radius of a lexicographic optimum of a vector problem of Boolean programming
• Solution and investigation of one class of inexact integer programming problems
• A decomposition approach to the solution of some integer programming problems with inexact data
• scientific article; zbMATH DE number 4156196 (Why is no real title available?)
• scientific article; zbMATH DE number 4087425 (Why is no real title available?)
• Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
• Interval estimation of alternatives in decision-making problems
• Alternative group relaxation of integer programming problems
• Uncertainty measure for the Bellman-Johnson problem with interval processing times

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

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