Multiple cost coefficients sensitivity theorems of integer linear optimization

DOI10.1080/02331934.2021.1892102MaRDI QIDQ5039396zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

sensitivityLagrangian dualinteger optimizationpost optimality conditions

Mathematics Subject Classification ID

Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06)

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

• scientific article; zbMATH DE number 3791939 (Why is no real title available?)
• scientific article; zbMATH DE number 47668 (Why is no real title available?)
• scientific article; zbMATH DE number 3516918 (Why is no real title available?)
• scientific article; zbMATH DE number 3554027 (Why is no real title available?)
• scientific article; zbMATH DE number 1845876 (Why is no real title available?)
• scientific article; zbMATH DE number 3410784 (Why is no real title available?)
• A Convergent Duality Theory for Integer Programming
• An algorithm for the solution of multiparametric mixed integer linear programming problems
• Applied integer programming. Modeling and solution.
• Asymptotic strong determination in integer programming: Quasi dual method
• Combinatorial optimization. Theory and algorithms.
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Global optimization issues in multiparametric continuous and mixed-integer optimization problems
• Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming
• Integer Programming
• Integer programming duality: Price functions and sensitivity analysis
• Multi-parametric analysis of the maximum tolerance in a linear programming problem
• Non-linear integer programming: Sensitivity analysis for branch and bound
• On the augmented Lagrangian dual for integer programming
• Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
• Reformulation and decomposition of integer programs
• Robust sensitivity analysis of the optimal value of linear programming
• Sensitivity Analysis for Branch and Bound Integer Programming
• Sensitivity theorems in integer linear programming
• The group-theoretic approach in mixed integer programming
• The structure of group relaxations
• Three methods for postoptimal analysis in integer linear programming
• Tolerance sensitivity and optimality bounds in linear programming
• Towards strong duality in integer programming

Cited in

(2)

• Two sensitivity theorems in fuzzy integer programming.
• Sensitivity theorems in integer linear programming

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)