Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty

DOI10.1007/s10559-007-0028-8zbMath1135.90370OpenAlexW2089337087MaRDI QIDQ2458112

N. V. Semenova

Publication date: 31 October 2007

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

Full work available at URL: https://doi.org/10.1007/s10559-007-0028-8

zbMATH Keywords

discrete optimizationinteger variablesinexact dataperturbations in initial dataquadratic constraint functions

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15)

Related Items (3)

Bilevel optimization problems of distribution of interbudgetary transfers under given limitations ⋮ A systematic approach to multiobjective optimization ⋮ Finding compromise and consensus in multicriteria problems

Cites Work

• Robust convex quadratically constrained programs
• Integer programming problems with inexact data: Exact and approximate solutions
• The Cutting-Plane Method for Solving Convex Programs
• An approach to the construction of approximate solutions of Boolean linear programming problems
• Analytic study of a class of dynamic models. I
• Solution and investigation of one class of inexact integer programming problems
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty