A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems

DOI10.1007/978-3-642-12686-4_12zbMath1359.90075OpenAlexW2104101738MaRDI QIDQ2974424

Mette Bjørndal, Kurt O. Jørnsten

Publication date: 7 April 2017

Published in: Handbook of Power Systems II (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12686-4_12

zbMATH Keywords

integer programmingpricingnon-convexitiesindivisibilitiesBender's partitioning method

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (3)

Exploiting complete linear descriptions for decentralized power market problems with integralities ⋮ Optimal Pricing in Markets with Nonconvex Costs ⋮ Critical Review of Pricing Schemes in Markets with Non-Convex Costs

Cites Work

• Unnamed Item
• Equilibrium prices supported by dual price functions in markets with non-convexities
• Partitioning procedures for solving mixed-variables programming problems
• Duality in mathematics and linear and integer programming
• Integer Programming and Pricing
• Mathematical Programming and Economic Theory
• Integer programming duality: Price functions and sensitivity analysis

This page was built for publication: A Partitioning Method that Generates Interpretable Prices for Integer Programming Problems