Average shadow price in a mixed integer linear programming problem

DOI10.1016/0377-2217(94)00003-UzbMath0912.90224OpenAlexW1978320039MaRDI QIDQ1127163

Alejandro Crema

Publication date: 25 May 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00003-u

zbMATH Keywords

Lagrangean relaxationshadow pricepure integer linear programming

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11)

Related Items (7)

Generalized average shadow prices and bottlenecks ⋮ Directional shadow price in linearly constrained nonconvex optimization models ⋮ Informative Lagrange multipliers in nonlinear parametric programming models ⋮ Efficient market-clearing prices in markets with nonconvexities ⋮ Average shadow price and equilibrium price: a case study of tradable pollution permit markets ⋮ A procedure to verify the completeness of the right-hand-side parametric analysis for a mixed integer linear programming problem ⋮ The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price

Cites Work

• Unnamed Item
• Unnamed Item
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• A shadow price in integer programming for management decision
• Marginal values in mixed integer linear programming
• Parametric methods in integer linear programming
• Integer Programming and Pricing
• A Note on Shadow Prices in Linear Programming
• The Computation of Shadow Prices in Linear Programming
• Parametric Mixed Integer Programming: An Application to Solid Waste Management

This page was built for publication: Average shadow price in a mixed integer linear programming problem