IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v53y2012i1p29-51.html
   My bibliography  Save this article

On linear programs with linear complementarity constraints

Author

Listed:
  • Jing Hu
  • John Mitchell
  • Jong-Shi Pang
  • Bin Yu

Abstract

No abstract is available for this item.

Suggested Citation

  • Jing Hu & John Mitchell & Jong-Shi Pang & Bin Yu, 2012. "On linear programs with linear complementarity constraints," Journal of Global Optimization, Springer, vol. 53(1), pages 29-51, May.
    • Handle: RePEc:spr:jglopt:v:53:y:2012:i:1:p:29-51
    DOI: 10.1007/s10898-010-9644-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9644-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9644-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Egon Balas, 1971. "Intersection Cuts—A New Type of Cutting Planes for Integer Programming," Operations Research, INFORMS, vol. 19(1), pages 19-39, February.
    2. Holger Scheel & Stefan Scholtes, 2000. "Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 1-22, February.
    3. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Karan N. Chadha & Ankur A. Kulkarni, 2022. "On independent cliques and linear complementarity problems," Indian Journal of Pure and Applied Mathematics, Springer, vol. 53(4), pages 1036-1057, December.
    2. Hoai An Thi & Thi Minh Tam Nguyen & Tao Pham Dinh, 2023. "On solving difference of convex functions programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 86(1), pages 163-197, September.
    3. Ying Cui & Ziyu He & Jong-Shi Pang, 2021. "Nonconvex robust programming via value-function optimization," Computational Optimization and Applications, Springer, vol. 78(2), pages 411-450, March.
    4. Wei Xia & Juan C. Vera & Luis F. Zuluaga, 2020. "Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 40-56, January.
    5. Lei, Chao & Jiang, Zhoutong & Ouyang, Yanfeng, 2020. "Path-based dynamic pricing for vehicle allocation in ridesharing systems with fully compliant drivers," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 60-75.
    6. Tong, Jun & Hu, Jiaqiao & Hu, Jianqiang, 2017. "Computing equilibrium prices for a capital asset pricing model with heterogeneous beliefs and margin-requirement constraints," European Journal of Operational Research, Elsevier, vol. 256(1), pages 24-34.
    7. Bai, Yun & Ouyang, Yanfeng & Pang, Jong-Shi, 2016. "Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints," European Journal of Operational Research, Elsevier, vol. 249(1), pages 281-297.
    8. Francisco Jara-Moroni & John E. Mitchell & Jong-Shi Pang & Andreas Wächter, 2020. "An enhanced logical benders approach for linear programs with complementarity constraints," Journal of Global Optimization, Springer, vol. 77(4), pages 687-714, August.
    9. Dajun Yue & Jiyao Gao & Bo Zeng & Fengqi You, 2019. "A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs," Journal of Global Optimization, Springer, vol. 73(1), pages 27-57, January.
    10. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.
    11. Jun Tong & Jian-Qiang Hu & Jiaqiao Hu, 2017. "A Computational Algorithm for Equilibrium Asset Pricing Under Heterogeneous Information and Short-Sale Constraints," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-16, October.
    12. Lijie Bai & John Mitchell & Jong-Shi Pang, 2013. "On convex quadratic programs with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 54(3), pages 517-554, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wang, Guangmin & Xu, Meng & Grant-Muller, Susan & Gao, Zaihan, 2020. "Combination of tradable credit scheme and link capacity improvement to balance economic growth and environmental management in sustainable-oriented transport development: A bi-objective bi-level progr," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 459-471.
    2. Feijoo, Felipe & Das, Tapas K., 2014. "Design of Pareto optimal CO2 cap-and-trade policies for deregulated electricity networks," Applied Energy, Elsevier, vol. 119(C), pages 371-383.
    3. Acuna, Jorge A. & Zayas-Castro, Jose L. & Feijoo, Felipe, 2022. "A bilevel Nash-in-Nash model for hospital mergers: A key to affordable care," Socio-Economic Planning Sciences, Elsevier, vol. 83(C).
    4. Thai Doan Chuong, 2020. "Optimality conditions for nonsmooth multiobjective bilevel optimization problems," Annals of Operations Research, Springer, vol. 287(2), pages 617-642, April.
    5. Elias S. Helou & Sandra A. Santos & Lucas E. A. Simões, 2020. "Analysis of a New Sequential Optimality Condition Applied to Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 433-447, May.
    6. Andreas Lanz & Gregor Reich & Ole Wilms, 2022. "Adaptive grids for the estimation of dynamic models," Quantitative Marketing and Economics (QME), Springer, vol. 20(2), pages 179-238, June.
    7. Shi, Yi & Deng, Yawen & Wang, Guoan & Xu, Jiuping, 2020. "Stackelberg equilibrium-based eco-economic approach for sustainable development of kitchen waste disposal with subsidy policy: A case study from China," Energy, Elsevier, vol. 196(C).
    8. Lucio Bianco & Massimiliano Caramia & Stefano Giordani & Veronica Piccialli, 2016. "A Game-Theoretic Approach for Regulating Hazmat Transportation," Transportation Science, INFORMS, vol. 50(2), pages 424-438, May.
    9. Cerulli, Martina & Serra, Domenico & Sorgente, Carmine & Archetti, Claudia & Ljubić, Ivana, 2023. "Mathematical programming formulations for the Collapsed k-Core Problem," European Journal of Operational Research, Elsevier, vol. 311(1), pages 56-72.
    10. Chan Y. Han & Brian J. Lunday & Matthew J. Robbins, 2016. "A Game Theoretic Model for the Optimal Location of Integrated Air Defense System Missile Batteries," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 405-416, August.
    11. Lorenzo Lampariello & Simone Sagratella, 2015. "It is a matter of hierarchy: a Nash equilibrium problem perspective on bilevel programming," DIAG Technical Reports 2015-07, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    12. Grimm, Veronika & Schewe, Lars & Schmidt, Martin & Zöttl, Gregor, 2017. "Uniqueness of market equilibrium on a network: A peak-load pricing approach," European Journal of Operational Research, Elsevier, vol. 261(3), pages 971-983.
    13. Wei Jiang & Huiqiang Wang & Bingyang Li & Haibin Lv & Qingchuan Meng, 2020. "A multi-user multi-operator computing pricing method for Internet of things based on bi-level optimization," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477199, January.
    14. Lei Fang & Hecheng Li, 2013. "Lower bound of cost efficiency measure in DEA with incomplete price information," Journal of Productivity Analysis, Springer, vol. 40(2), pages 219-226, October.
    15. Zhang, Fang & Lu, Jian & Hu, Xiaojian & Meng, Qiang, 2023. "Integrated deployment of dedicated lane and roadside unit considering uncertain road capacity under the mixed-autonomy traffic environment," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    16. Vivek Laha & Harsh Narayan Singh, 2023. "On quasidifferentiable mathematical programs with equilibrium constraints," Computational Management Science, Springer, vol. 20(1), pages 1-20, December.
    17. Andreas Ehrenmann & Karsten Neuhoff, 2009. "A Comparison of Electricity Market Designs in Networks," Operations Research, INFORMS, vol. 57(2), pages 274-286, April.
    18. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    19. Gui-Hua Lin & Mei-Ju Luo & Jin Zhang, 2016. "Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints," Journal of Global Optimization, Springer, vol. 66(3), pages 487-510, November.
    20. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2015. "Solving Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 234-256, July.

    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:spr:jglopt:v:53:y:2012:i:1:p:29-51. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.