Algorithmic solution of two parametric optimization problems of a set of complete combinations

DOI10.1007/BF02742292zbMath0985.90086MaRDI QIDQ1582927

A. A. Roskladka, O. A. Yemets

Publication date: 2 May 2001

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

zbMATH Keywords

objective functionparametric analysismultisetdiscrete-optimization problem

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Combinatorial optimization (90C27)

Related Items (4)

Direct cut-off method for combinatorial optimization problems with additional constraints ⋮ Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements ⋮ Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations ⋮ A nonreducible system of constraints of a combinatorial polyhedron in a linear-fractional optimization problem on arrangements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability and unboundedness of vector optimization problems
• Set of strictly efficient points of mixed integer vector optimization problem as a measure of problem's stability
• A general approach to the study of the stability of solutions in discrete optimization problems
• Stability of discrete optimization problems
• Stability in vector optimization path problems
• Stability, parametric, and postoptimality analysis of discrete optimization problems
• Parametric trajectory problems

This page was built for publication: Algorithmic solution of two parametric optimization problems of a set of complete combinations