scientific article; zbMATH DE number 1114459

Publication date: 8 February 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey annotated bibliography postoptimal sensitivity analysis

Mixed integer programming (90C11) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items (41)

Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study ⋮ On the adjustment problem for linear programs ⋮ Stability and accuracy functions in multicriteria linear combinatorial optimization problems ⋮ Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item ⋮ A general approach to the calculation of stability radii for the max-cut problem with multiple criteria ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extending single tolerances to set tolerances ⋮ Stability and accuracy functions for a multicriteria Boolean linear programming problem with parameterized principle of optimality ``from Condorcet to Pareto ⋮ Stability analysis in discrete optimization involving generalized addition operations ⋮ The single row facility layout problem: state of the art ⋮ Quantitative stability analysis for vector problems of 0-1 programming ⋮ On a measure of quasistability of a certain vector linearly combinatorial Boolean problem ⋮ General approach to estimating the complexity of postoptimality analysis for discrete optimization problems ⋮ Extremal values of global tolerances in combinatorial optimization with an additive objective function ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems ⋮ Stability radius of a vector investment problem with Savage's minimax risk criteria ⋮ Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem ⋮ Tolerance analysis for 0-1 knapsack problems ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Stability criterion for a lexicographic Boolean optimization problem ⋮ Boolean problem of sequential minimization of moduli of linear functions and stability theorems ⋮ Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs ⋮ Reoptimization of the metric deadline TSP ⋮ Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies ⋮ Reoptimization of the Metric Deadline TSP ⋮ An algorithm for multiparametric min max 0-1-integer programming problems relative to the objective function ⋮ On the Hardness of Reoptimization ⋮ Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study ⋮ An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function ⋮ Approximation hardness of deadline-TSP reoptimization ⋮ Stability aspects of the traveling salesman problem based on \(k\)-best solutions ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ A note on robustness tolerances for combinatorial optimization problems ⋮ On the complexity of postoptimality analysis of \(0/1\) programs ⋮ Stability radius of a lexicographic optimum of a vector problem of Boolean programming ⋮ Evolution and state-of-the-art in integer programming ⋮ The multiparametric 0-1-integer linear programming problem: A unified approach ⋮ An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Uses Software

LINDO

This page was built for publication: