Generalized average shadow prices and bottlenecks

DOI10.1007/s00186-018-0630-8zbMath1407.90242OpenAlexW2791379558MaRDI QIDQ1616793

Alejandro Crema

Publication date: 7 November 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-018-0630-8

zbMATH Keywords

mixed integer programmingresource constraintsbottlenecksaverage shadow price

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (2)

Directional shadow price in linearly constrained nonconvex optimization models ⋮ Informative Lagrange multipliers in nonlinear parametric programming models

Cites Work

• An exact algorithm for the fixed-charge multiple knapsack problem
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
• A shadow price in integer programming for management decision
• Average shadow price in a mixed integer linear programming problem
• On the continuity of the maximum in parametric linear programming
• Sensitivity analysis in linear programming: Just be careful!
• Average shadow prices in mathematical programming
• Near-optimal solutions to large-scale facility location problems
• The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• The Multidimensional Knapsack Problem: Structure and Algorithms
• Integer Programming and Pricing
• A Note on Shadow Prices in Linear Programming
• Linear parametric programming—A brief survey
• Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
• The Computation of Shadow Prices in Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized average shadow prices and bottlenecks