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)
62P30: Applications of statistics in engineering and industry; control charts
90B25: Reliability, availability, maintenance, inspection in operations research
00B15: Collections of articles of miscellaneous specific interest
90-06: Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming
Related Items
Support set expansion sensitivity analysis in convex quadratic optimization, Sensitivity analysis in convex quadratic optimization: invariant support set interval, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual, 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, Post-optimality analysis of the optimal solution of a degenerate linear program using a pivoting algorithm, Solving linear programs from sign patterns, Postoptimal analysis in multicriteria linear programming, Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization, Active constraint set invariancy sensitivity analysis in linear optimization, Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems, Multiparametric linear programming: support set and optimal partition invariancy, Measuring dynamic efficiency: theories and an integrated methodology, Stability aspects of the traveling salesman problem based on \(k\)-best solutions, An algorithm to perform a complete parametric analysis relative to the constraint matrix for a 0-1-integer linear program, Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs, An asymptotic simplex method for singularly perturbed linear programs, Efficient algorithms for finding critical subgraphs, 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, Sensitivity analysis in the single-machine scheduling problem with max-min criterion, Stability of Networks in Stretchable Graphs, Unnamed Item, Local sensitivity and diagnostic tests
