Sensitivity analysis of vector discrete optimization problems.

MaRDI QIDQ5481218zbMATH OpenFDO

Authors Yury Nikulin

Publication date 8 August 2006

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Minimax problems in mathematical programming (90C47) Boolean programming (90C09)

Recommendations

• On stability of a Pareto optimum of a vector Boolean programming problem
• The stability radius of an efficient solution in minimax Boolean programming problem
• scientific article; zbMATH DE number 1560550
• On the radius of stability of a vector problem of linear Boolean programming
• Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem

Cited in

(4)

• Sensitivity analysis of the optimal assignment.
• Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
• Sensitivity analysis of discrete preference functions using Koszul simplicial complexes
• Stability and regularization of the lexicographic vector problem of quadratic discrete programming

This page was built for publication: Sensitivity analysis of vector discrete optimization problems.

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