Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
From MaRDI portal
Publication:3534643
Recommendations
- On the stability radius in the metric \(l_1\) of the Pareto-optimal solution of a vector problem of Boolean programming
- On stability of a Pareto optimum of a vector Boolean programming problem
- Stability radius of a lexicographic optimum of a vector problem of Boolean programming
- The stability radius of an efficient solution in minimax Boolean programming problem
- On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions
Cites work
- Calculation of stability radii for combinatorial optimization problems
- Comparative analysis of different types of stability with respect to constraints of a vector integer-optimization problem
- Multicriteria combinatorial linear problems: parametrisation of the optimality principle and the stability of the effective solutions
- On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function
- On stability of a Pareto optimum of a vector Boolean programming problem
- On the complexity of postoptimality analysis of \(0/1\) programs
- On the quasistability of trajectory problems of vector optimization
- On the radii of steadiness, quasi-steadiness, and stability of a vector trajectory problem on lexicographic optimization
- On the strong stability of a vector trajectorial problem of the lexicographic optimization
- Sensitivity analysis of efficient solutions of the vector problem of minimisation of linear forms on a set of permutations
- Some concepts of stability analysis in combinatorial optimization
- Stability analysis in optimization problems on matroids in the metric \(l_1\)
- Stability and Regularization of Vector Problems of Integer Linear Programming
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- Stability in the combinatorial vector optimization problems
- Stability of discrete vector problems with the parametric principle of optimality
Cited in
(12)- Sensitivity analysis of vector discrete optimization problems.
- A two-step method for solving vector optimization problems on permutation configuration
- Stability radius of an efficient solution of a vector problem of integer linear programming in the Hölder metric
- Postoptimal analysis of the multicriteria combinatorial median location problem
- On one type of stability for multiobjective integer linear programming problem with parameterized optimality
- Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto
- Stability analysis of efficient portfolios in a discrete variant of multicriteria investment problem with Savage's risk criteria
- Multicriteria investment problem with Savage's risk criteria: theoretical aspects of stability and case study
- On the stability radius in the metric \(l_1\) of the Pareto-optimal solution of a vector problem of Boolean programming
- Postoptimal analysis of bicriteria Boolean problems of selecting investment projects with Wald's and Savage's criteria
- On radius of one stability type for a multicriteria investment problem with risk minimization
- A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
This page was built for publication: Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534643)
