Solution and investigation of one class of inexact integer programming problems

DOI10.1007/BF01070127zbMath0746.90040MaRDI QIDQ4005344

V. A. Roshchin, N. V. Semenova, Ivan V. Sergienko

Publication date: 26 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

inexact objective functioninexact constraint matrix coefficients

Mathematics Subject Classification ID

Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Interval discrete programming ⋮ Bilevel optimization problems of distribution of interbudgetary transfers under given limitations ⋮ Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty ⋮ An approach to solving discrete vector optimization problems over a combinatorial set of permutations ⋮ Integer programming problems with inexact data: Exact and approximate solutions

Cites Work

• Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution and investigation of one class of inexact integer programming problems