Integer programming duality: Price functions and sensitivity analysis
From MaRDI portal
Publication:3908768
DOI10.1007/BF01589344zbMath0458.90047OpenAlexW2068913356MaRDI QIDQ3908768
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01589344
algorithmssensitivity analysisLagrangean relaxationvalid inequalitiescomplementarity conditionspostoptimality analysisbranch and bound methodsgroup problemseconomic interpretationinteger programming dualityprice functioneconomic implicationsfractional cutting planes
Related Items
Multiple cost coefficients sensitivity theorems of integer linear optimization, Subadditive approaches in integer programming, Parametric methods in integer linear programming, Generating functions and duality for integer programs, Pricing combinatorial auctions by a set of linear price vectors, Exploiting complete linear descriptions for decentralized power market problems with integralities, A pricing scheme for combinatorial auctions based on bundle sizes, A shadow price in integer programming for management decision, A unified approach for price directive decomposition procedures in integer programming, Lattice-free simplices with lattice width \(2d - o(d)\), A closed-form representation of mixed-integer program value functions, Single Allocation Hub Location with Heterogeneous Economies of Scale, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Marginal values in mixed integer linear programming, Constructing the value function for an integer linear programme over a cone, Stability, parametric, and postoptimality analysis of discrete optimization problems, Discrete subadditive functions as Gomory functions, 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, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, Enumeration and unimodular equivalence of empty delta-modular simplices, The b-hull of an integer program, Two-stage quadratic integer programs with stochastic right-hand sides, 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, Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function, Optimal Pricing in Markets with Nonconvex Costs, Equilibrium prices supported by dual price functions in markets with non-convexities, Optimality certificates for convex minimization and Helly numbers, Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions, Efficient market-clearing prices in markets with nonconvexities, Subadditive duality in multiobjective integer linear programming, Towards strong duality in integer programming, Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach, Superadditive characterizations of pure integer programming feasibility, Critical Review of Pricing Schemes in Markets with Non-Convex Costs, Some concepts of stability analysis in combinatorial optimization, A Gilmore-Gomory construction of integer programming value functions, On Subadditive Duality for Conic Mixed-integer Programs, An elementary survey of general duality theory in mathematical programming, L-shaped decomposition of two-stage stochastic programs with integer recourse, Non-linear anonymous pricing combinatorial auctions, Duality in mathematics and linear and integer programming, The allocation of shared fixed costs, A framework for generalized Benders' decomposition and its application to multilevel optimization, The value function of an integer program, Constructive characterizations of the value-function of a mixed-integer program. I, A Unified Framework for Multistage Mixed Integer Linear Optimization, A primal dual integer programming algorithm, Constructive characterizations of the value function of a mixed-integer program. II, On abstract duality in mathematical programming
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- The value function of a mixed integer program: I
- Cutting-plane theory: Algebraic methods
- The value function of a mixed integer program. II
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Integer Programming and Pricing
- Minimal inequalities
- On the existence of optimal solutions to integer and mixed-integer programming problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Concepts of optimality and their uses
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- A Convergent Duality Theory for Integer Programming
- On the Group Problem and a Subadditive Approach to Integer Programming
- Maximum matching and a polyhedron with 0,1-vertices
- A tree-search algorithm for mixed integer programming problems
- Some continuous functions related to corner polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
