IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/431.html
   My bibliography  Save this paper

Integer programming duality: price functions and sensitivity analysis

Author

Listed:
  • WOLSEY, Laurence A.

Abstract

No abstract is available for this item.

Suggested Citation

  • WOLSEY, Laurence A., 1981. "Integer programming duality: price functions and sensitivity analysis," LIDAM Reprints CORE 431, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:431
    DOI: 10.1007/BF01589344
    Note: In : Mathematical Programming, 20, 173-195, 1981
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Drexl, Andreas & Jørnsten, Kurt & Knof, Diether, 2009. "Non-linear anonymous pricing combinatorial auctions," European Journal of Operational Research, Elsevier, vol. 199(1), pages 296-302, November.
    2. Martin Bichler & Vladimir Fux & Jacob Goeree, 2018. "A Matter of Equality: Linear Pricing in Combinatorial Exchanges," Information Systems Research, INFORMS, vol. 29(4), pages 1024-1043, December.
    3. Andrew C. Trapp & Oleg A. Prokopyev & Andrew J. Schaefer, 2013. "On a Level-Set Characterization of the Value Function of an Integer Program and Its Application to Stochastic Programming," Operations Research, INFORMS, vol. 61(2), pages 498-511, April.
    4. Klabjan, Diego, 2007. "Subadditive approaches in integer programming," European Journal of Operational Research, Elsevier, vol. 183(2), pages 525-545, December.
    5. M. W. Dawande & J. N. Hooker, 2000. "Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming," Operations Research, INFORMS, vol. 48(4), pages 623-634, August.
    6. Amitabh Basu & Kipp Martin & Christopher Thomas Ryan & Guanyi Wang, 2019. "Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications," Management Science, INFORMS, vol. 44(4), pages 1264-1285, November.
    7. Onur Tavaslıoğlu & Oleg A. Prokopyev & Andrew J. Schaefer, 2019. "Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function," Operations Research, INFORMS, vol. 67(6), pages 1659-1677, November.
    8. Dirk Briskorn & Kurt Jørnsten & Jenny Nossack, 2016. "Pricing combinatorial auctions by a set of linear price vectors," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 1043-1070, October.
    9. A Drexl & K Jørnsten, 2007. "Reflections about pseudo-dual prices in combinatorial auctions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1652-1659, December.
    10. Samira Fallah & Ted K. Ralphs & Natashia L. Boland, 2024. "On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 175-220, August.
    11. Sioshansi, Ramteen & Miller, Jacob, 2011. "Plug-in hybrid electric vehicles can be clean and economical in dirty power systems," Energy Policy, Elsevier, vol. 39(10), pages 6151-6161, October.
    12. Navid Azizan & Yu Su & Krishnamurthy Dvijotham & Adam Wierman, 2020. "Optimal Pricing in Markets with Nonconvex Costs," Operations Research, INFORMS, vol. 68(2), pages 480-496, March.
    13. Jean B. Lasserre, 2013. "Inverse Polynomial Optimization," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 418-436, August.
    14. Xiaoling Sun & Duan Li, 2000. "Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation," Mathematics of Operations Research, INFORMS, vol. 25(4), pages 625-644, November.
    15. Lukas Hümbs & Alexander Martin & Lars Schewe, 2022. "Exploiting complete linear descriptions for decentralized power market problems with integralities," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 451-474, June.
    16. Ramteen Sioshansi and Ashlin Tignor, 2012. "Do Centrally Committed Electricity Markets Provide Useful Price Signals?," The Energy Journal, International Association for Energy Economics, vol. 0(Number 4).
    17. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    18. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    19. George Liberopoulos & Panagiotis Andrianesis, 2016. "Critical Review of Pricing Schemes in Markets with Non-Convex Costs," Operations Research, INFORMS, vol. 64(1), pages 17-31, February.
    20. O'Neill, Richard P. & Sotkiewicz, Paul M. & Hobbs, Benjamin F. & Rothkopf, Michael H. & Stewart, William R., 2005. "Efficient market-clearing prices in markets with nonconvexities," European Journal of Operational Research, Elsevier, vol. 164(1), pages 269-285, July.
    21. Bjørndal, Mette & Jörnsten, Kurt, 2008. "Equilibrium prices supported by dual price functions in markets with non-convexities," European Journal of Operational Research, Elsevier, vol. 190(3), pages 768-789, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvrp:431. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.