Integer programming duality: Price functions and sensitivity analysis
From MaRDI portal
Publication:3908768
Cites work
- A Convergent Duality Theory for Integer Programming
- A tree-search algorithm for mixed integer programming problems
- Concepts of optimality and their uses
- Cutting-plane theory: Algebraic methods
- Edmonds polytopes and a hierarchy of combinatorial problems
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- scientific article; zbMATH DE number 3643042 (Why is no real title available?)
- scientific article; zbMATH DE number 3488914 (Why is no real title available?)
- scientific article; zbMATH DE number 3496213 (Why is no real title available?)
- scientific article; zbMATH DE number 3578640 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3637601 (Why is no real title available?)
- scientific article; zbMATH DE number 3431974 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- Integer Programming and Pricing
- Maximum matching and a polyhedron with 0,1-vertices
- Minimal inequalities
- On the existence of optimal solutions to integer and mixed-integer programming problems
- On the Group Problem and a Subadditive Approach to Integer Programming
- Partitioning procedures for solving mixed-variables programming problems
- Some continuous functions related to corner polyhedra
- Some polyhedra related to combinatorial problems
- The value function of a mixed integer program: I
- The value function of a mixed integer program. II
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(56)- Non-linear anonymous pricing combinatorial auctions
- Constructive characterizations of the value function of a mixed-integer program. II
- A shadow price in integer programming for management decision
- A unified approach for price directive decomposition procedures in integer programming
- Marginal values in mixed integer linear programming
- The b-hull of an integer program
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- A primal dual integer programming algorithm
- A pricing scheme for combinatorial auctions based on bundle sizes
- Optimality certificates for convex minimization and Helly numbers
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
- Some concepts of stability analysis in combinatorial optimization
- A closed-form representation of mixed-integer program value functions
- Constructing the value function for an integer linear programme over a cone
- A Gilmore-Gomory construction of integer programming value functions
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- Exploiting complete linear descriptions for decentralized power market problems with integralities
- Lattice-free simplices with lattice width \(2d - o(d)\)
- Subadditive approaches in integer programming
- Generating functions and duality for integer programs
- Towards strong duality in integer programming
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- Duality in mathematics and linear and integer programming
- The allocation of shared fixed costs
- Parametric methods in integer linear programming
- Subadditive duality in multiobjective integer linear programming
- Critical review of pricing schemes in markets with non-convex costs
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning
- A partitioning method that generates interpretable prices for integer programming problems
- Stability, parametric, and postoptimality analysis of discrete optimization problems
- Pricing combinatorial auctions by a set of linear price vectors
- An elementary survey of general duality theory in mathematical programming
- The value function of an integer program
- On abstract duality in mathematical programming
- Two-stage quadratic integer programs with stochastic right-hand sides
- Discrete subadditive functions as Gomory functions
- A unified framework for multistage mixed integer linear optimization
- Multiple cost coefficients sensitivity theorems of integer linear optimization
- Single allocation hub location with heterogeneous economies of scale
- The gap function: evaluating integer programming models over multiple right-hand sides
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Optimal pricing in markets with nonconvex costs
- On Subadditive Duality for Conic Mixed-integer Programs
- Superadditive characterizations of pure integer programming feasibility
- Evaluating mixed-integer programming models over multiple right-hand sides
- Continuous cutting plane algorithms in integer programming
- Coordination of manufacturing and engineering activities during product transitions
- Walrasian equilibria from an optimization perspective: A guide to the literature
- Enumeration and unimodular equivalence of empty delta-modular simplices
- Relaxations and duality for multiobjective integer programming
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- Solving a class of two-stage stochastic nonlinear integer programs using value functions
- Efficient market-clearing prices in markets with nonconvexities
- Constructive characterizations of the value-function of a mixed-integer program. I
- Equilibrium prices supported by dual price functions in markets with non-convexities
This page was built for publication: Integer programming duality: Price functions and sensitivity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3908768)
