Advances in sensitivity analysis and parametric programming
From MaRDI portal
Publication:1374470
zbMath0881.00025MaRDI QIDQ1374470
No author found.
Publication date: 8 December 1997
Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)
Applications of statistics in engineering and industry; control charts (62P30) Reliability, availability, maintenance, inspection in operations research (90B25) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (45)
Envelope Theorems for Multistage Linear Stochastic Optimization ⋮ Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients ⋮ Sensitivity analysis: a review of recent advances ⋮ Approximate multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem ⋮ Gröbner bases in asymptotic analysis of perturbed polynomial programs ⋮ Limit laws for empirical optimal solutions in random linear programs ⋮ Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm ⋮ Extending single tolerances to set tolerances ⋮ Post-optimality approach to prevent cycling in linear MPC target calculation ⋮ On the separation of parametric convex polyhedral sets with application in MOLP. ⋮ Unnamed Item ⋮ Solving linear programs from sign patterns ⋮ Postoptimal analysis in multicriteria linear programming ⋮ The Worst Case Finite Optimal Value in Interval Linear Programming ⋮ Tolerances, robustness and parametrization of matrix properties related to optimization problems ⋮ Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization ⋮ Inverse linear programming with interval coefficients ⋮ Active constraint set invariancy sensitivity analysis in linear optimization ⋮ Global sensitivity analysis via a statistical tolerance approach ⋮ Efficient algorithms for finding critical subgraphs ⋮ Sensitivity analysis in the single-machine scheduling problem with max-min criterion ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs ⋮ Local sensitivity and diagnostic tests ⋮ Support set expansion sensitivity analysis in convex quadratic optimization ⋮ Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems ⋮ Sensitivity analysis in convex quadratic optimization: invariant support set interval ⋮ Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem ⋮ 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 ⋮ Stability of Networks in Stretchable Graphs ⋮ Sensitivity Analysis in Markov Decision Processes with Uncertain Reward Parameters ⋮ Multiparametric linear programming: support set and optimal partition invariancy ⋮ Measuring dynamic efficiency: theories and an integrated methodology ⋮ Analysis of the sensitivity of solutions of multicriteria problems based on parametric partial preference relations ⋮ Sensitivity analysis of a greedy heuristic for knapsack problems ⋮ Sensitivity analysis in linear optimization: invariant support set intervals ⋮ Multiparametric sensitivity analysis of the constraint matrix in linear-plus-linear fractional programming problem ⋮ Unnamed Item ⋮ An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program ⋮ On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization ⋮ An asymptotic simplex method for singularly perturbed linear programs ⋮ Empirical Regularized Optimal Transport: Statistical Theory and Applications ⋮ Robust aspects of solutions in deterministic multiple objective linear programming ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
This page was built for publication: Advances in sensitivity analysis and parametric programming
