Multiple cost coefficients sensitivity theorems of integer linear optimization
From MaRDI portal
Publication:5039396
DOI10.1080/02331934.2021.1892102zbMATH Open1504.90087OpenAlexW3134704528MaRDI QIDQ5039396FDOQ5039396
Authors: Yu-Ching Lee, Hsin-Pin Wu 
Publication date: 12 October 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2021.1892102
Recommendations
- scientific article; zbMATH DE number 1163810
- Matrix Sensitivity Analysis from an Interior Solution of a Linear Program
- Some observations on the perturbation of the vectors \(b\) and \(c\) in a linear programming problem.
- Perturbation approach to sensitivity analysis in mathematical programming
- Sensitivity function: properties and applications
- Dynamical sensitivity analysis and its applications of simplex method for linear programming
- Approaches to sensitivity analysis in linear programming
- Formulae for the sensitivity analysis of linear programming problems
- Introduction to sensitivity and stability analysis in nonlinear programming
- SENSITIVITY ANALYSIS OF OBJECTIVE FUNCTION COEFFICIENTS OF THE ASSIGNMENT PROBLEM
Cites Work
- Combinatorial optimization. Theory and algorithms.
- The group-theoretic approach in mixed integer programming
- Sensitivity theorems in integer linear programming
- An algorithm for the solution of multiparametric mixed integer linear programming problems
- Title not available (Why is that?)
- Towards strong duality in integer programming
- Reformulation and decomposition of integer programs
- Integer programming duality: Price functions and sensitivity analysis
- Global optimization issues in multiparametric continuous and mixed-integer optimization problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applied integer programming. Modeling and solution.
- On the augmented Lagrangian dual for integer programming
- Integer Programming
- Tolerance sensitivity and optimality bounds in linear programming
- Multi-parametric analysis of the maximum tolerance in a linear programming problem
- Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
- A Convergent Duality Theory for Integer Programming
- Title not available (Why is that?)
- Three methods for postoptimal analysis in integer linear programming
- Sensitivity Analysis for Branch and Bound Integer Programming
- Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
- The structure of group relaxations
- Non-linear integer programming: Sensitivity analysis for branch and bound
- Title not available (Why is that?)
- Asymptotic strong determination in integer programming: Quasi dual method
- Robust sensitivity analysis of the optimal value of linear programming
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Multiple cost coefficients sensitivity theorems of integer linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039396)
