Sensitivity Analysis for Branch and Bound Integer Programming
Consider the mixed integer programming (MIP) problem P: z\(=\max \sum^{n}_{j=1}c_ jx_ j\) s.t. \(\sum^{n}_{j=1}a_{ij}x_ j\leq b\), \(x_ j\geq 0\) for \(j\in N=\{1,\ldots,n\}\), \(x_ j\in \{0,1\}\) for \(j\in J\subseteq N\), where \(a_ j\) and b are rational column vectors in \(R^ n\). The following questions are considered: 1.) The right-hand side b of P is replaced by a new right-hand side d. What is an upper bound on the new value of z? 2.) A new 0/1 activity \(a_ j\) becomes available. For what upper bound on the value of \(c_ j\) does the activity \(a_ j\) remain at the zero level in an optimal integer solution? The paper has two distinct parts. In the first part questions 1 and 2 are answered assuming that a standard branch-and-bound code is applied directly to solve the MIP problem (P). In the second part sensitivity analysis is considered in case when both cuts and branch-and-bound are used.
- Non-linear integer programming: Sensitivity analysis for branch and bound
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- Sensitivity analysis of mixed integer programs: An application to environmental policy making
- Non-linear integer programming: Sensitivity analysis for branch and bound
- An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study
- Compact representation of near-optimal integer programming solutions
- Parametric methods in integer linear programming
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- Real-time personnel re-scheduling after a minor disruption in the retail industry
- Postoptimal Analysis in Nonserial Dynamic Programming
- Challenges in Enterprise Wide Optimization for the Process Industries
- scientific article; zbMATH DE number 1114459 (Why is no real title available?)
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- scientific article; zbMATH DE number 764459 (Why is no real title available?)
- scientific article; zbMATH DE number 6419199 (Why is no real title available?)
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Sensitivity analysis of efficient solution in vector MINMAX Boolean programming problem
- Evaluating mixed-integer programming models over multiple right-hand sides
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- Approximating the stability region for binary mixed-integer programs
- Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
This page was built for publication: Sensitivity Analysis for Branch and Bound Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3706845)