Generalized average shadow prices and bottlenecks

Original Article


Usually some of the constraints of a 0-1-Mixed Integer Linear Programming problem correspond to resources and in this paper we suppose that they may be redefined. For the availability of the resources the average shadow price is the maximum price that the decision maker is willing to pay for an additional unit of the package (i.e. a combination) of resources defined by some direction. In this paper we present a generalization of the average shadow price and its relation with bottlenecks including the analysis relative to the coefficients matrix of resource constraints. The generalization presented does not have some limitations of the usual average shadow price. A mathematical programming approach to find the strategy for investment in resources is presented.


Mixed integer programming Average shadow price Bottlenecks Resource constraints 


  1. Akgull MA (1984) A note on shadow prices in linear programming. J Oper Res Soc 35:425–431CrossRefGoogle Scholar
  2. Alkaly RE, Klevorick AK (1966) A note on the dual prices of integer programs. Econometrica 34:206–214CrossRefGoogle Scholar
  3. Aucamp DC, Steinberg DC (1982) The computation of shadow prices in linear programming. J Oper Res Soc 33:557–565MathSciNetCrossRefMATHGoogle Scholar
  4. Barahona F, Chudak FA (2005) Near-optimal solutions to large-scale facility location problems. Discrete Optim 2:35–50MathSciNetCrossRefMATHGoogle Scholar
  5. Bonyadi MR, Michalewicz Z (2014a) Evolutionary computation for real-world problems. Challenges in computational statistics and data mining. In: Matwin S, Mielnikzuk J (eds) Studies in computational intelligence. Springer, BerlinGoogle Scholar
  6. Bonyadi MR, Michalewicz Z, Wagner M (2014b) Beyond the edge of feasibility: analysis of bottlenecks. Simulated Evolution and Learning Lecture Notes Computer Science, vol. 8886, pp 431–442Google Scholar
  7. Crema A (1995) Average shadow price in a mixed integer linear programming problem. Eur J Oper Res 85(3):625–635MathSciNetCrossRefMATHGoogle Scholar
  8. Freund RM (1985) Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients. Math Program Stud 24:1–13MathSciNetCrossRefMATHGoogle Scholar
  9. Gal T (1984) Linear parametric programming—a brief survey. Math Program Stud 21:43–68MathSciNetCrossRefMATHGoogle Scholar
  10. Gal T (1986) Shadow prices and sensitivity analysis in linear programming under degeneracy. State Art Surv Oper Res Spectr 8:59–71MATHGoogle Scholar
  11. Gomory RE, Baumol WJ (1960) Integer programming and prices. Econometrica 28:521–550MathSciNetCrossRefMATHGoogle Scholar
  12. Gupte A, Ahmed S, Cheon MS, Dey S (2013) Solving mixed integer bilinear problems using milp formulations. SIAM J Optim 23(2):721–744MathSciNetCrossRefMATHGoogle Scholar
  13. Jansen B, Roos C, de Jong JJ, Terlaky T (1997) Sensitivity analysis in linear programming: just be careful!. Eur J Oper Res 101(1):15–28CrossRefMATHGoogle Scholar
  14. Kim S, Cho S (1988) A shadow price in integer programming for management decision. Eur J Oper Res 37(3):328–335MathSciNetCrossRefMATHGoogle Scholar
  15. Kim S, Cho S (1992) Average shadow prices in mathematical programming. J Optim Theory Appl 74(1):57–74MathSciNetCrossRefMATHGoogle Scholar
  16. Martello S, Toth P (1990) Knapsack problems, algorithms and computer implementations. Wiley, New YorkMATHGoogle Scholar
  17. Martin DH (1975) On the continuity of the maximum in parametric linear programming. J Optim Theory Appl 17(3/4):205–210MathSciNetCrossRefMATHGoogle Scholar
  18. Mukherjee S, Chatterjeeb AK (2006a) The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price. Eur J Oper Res 169(1):53–64MathSciNetCrossRefMATHGoogle Scholar
  19. Mukherjee S, Chatterjeeb AK (2006b) Unified concept of Bottleneck. Indian Institute of Management Ahmedabad-380015, India. W.P. No. 2006-05-01Google Scholar
  20. Puchinger J, Raidl G, Pferschy U (2010) The multidimensional knapsack problem: structure and algorithms. INFORMS J Comput 22(2):250–265MathSciNetCrossRefMATHGoogle Scholar
  21. Shapiro JF (1979) Mathematical programming. Wiley, New YorkMATHGoogle Scholar
  22. Williams HP (1997) Integer programming revisited. IMA J Math Appl Bus Ind 8:203–213MathSciNetMATHGoogle Scholar
  23. Yamada T, Takeoka T (2009) An exact algorithm for the fixed-charge multiple knapsack problem. Eur J Oper Res 192:700–705MathSciNetCrossRefMATHGoogle Scholar
  24. Zuidwijk RA (2005) Linear parametric sensitivity analysis of the constraint coefficient matrix in linear programs. Erasmus Research Institute of Management, Report Series Research in ManagementGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Escuela de Computación, Facultad de CienciasUniversidad Central de VenezuelaCaracasVenezuela

Personalised recommendations