IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v293y2021i1p36-49.html
   My bibliography  Save this article

Ellipsoidal one-class constraint acquisition for quadratically constrained programming

Author

Listed:
  • Pawlak, Tomasz P.
  • Litwiniuk, Bartosz

Abstract

We propose Ellipsoidal One-Class Constraint Acquisition (EOCCA), a fast and scalable algorithm for the acquisition of constraints for Mixed-Integer Quadratically Constrained Programming (MIQCP) models from data. EOCCA acquires a well-formed MIQCP model using solely the examples of the feasible solutions to this model. It combines x-means partitioning, standardization, and principal components analysis to preprocess the training set and then wraps the preprocessed data into several hyper-ellipsoids expressed using MIQCP constraints. These MIQCP constraints are projected back to the space of the original training set, and their further use does not require data preprocessing. Experimental evaluation shows that EOCCA scores better than a state-of-the-art algorithm in terms of fidelity of the acquired constraints to ground-truth constraints and achieves this in few orders of magnitude shorter time. We demonstrate the practical use case of EOCCA in a fully automated workflow of modeling and optimization of a rice farm using real-world data.

Suggested Citation

  • Pawlak, Tomasz P. & Litwiniuk, Bartosz, 2021. "Ellipsoidal one-class constraint acquisition for quadratically constrained programming," European Journal of Operational Research, Elsevier, vol. 293(1), pages 36-49.
  • Handle: RePEc:eee:ejores:v:293:y:2021:i:1:p:36-49
    DOI: 10.1016/j.ejor.2020.12.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720310468
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.12.018?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. Ravindra K. Ahuja & James B. Orlin, 2001. "Inverse Optimization," Operations Research, INFORMS, vol. 49(5), pages 771-783, October.
    2. Pawlak, Tomasz P. & Krawiec, Krzysztof, 2017. "Automatic synthesis of constraints from examples using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1141-1157.
    3. Qu Feng & William C. Horrace, 2012. "Alternative technical efficiency measures: Skew, bias and scale," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 27(2), pages 253-268, March.
    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. Potoniec, Jedrzej & Sroka, Daniel & Pawlak, Tomasz P., 2022. "Continuous discovery of Causal nets for non-stationary business processes using the Online Miner," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1304-1320.

    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. Hewitt, Mike & Frejinger, Emma, 2020. "Data-driven optimization model customization," European Journal of Operational Research, Elsevier, vol. 287(2), pages 438-451.
    2. Anil Aswani & Zuo-Jun Max Shen & Auyon Siddiq, 2019. "Data-Driven Incentive Design in the Medicare Shared Savings Program," Operations Research, INFORMS, vol. 67(4), pages 1002-1026, July.
    3. Feng, Qu & Horrace, William C., 2012. "Estimating technical efficiency in micro panels," Economics Letters, Elsevier, vol. 117(3), pages 730-733.
    4. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    5. Janne Gustafsson, 2020. "Valuation of Research and Development Projects Using Buying and Selling Prices: Generalized Definitions," Decision Analysis, INFORMS, vol. 17(2), pages 154-168, June.
    6. Timothy C. Y. Chan & Tim Craig & Taewoo Lee & Michael B. Sharpe, 2014. "Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy," Operations Research, INFORMS, vol. 62(3), pages 680-695, June.
    7. William Horrace & Seth Richards-Shubik & Ian Wright, 2015. "Expected efficiency ranks from parametric stochastic frontier models," Empirical Economics, Springer, vol. 48(2), pages 829-848, March.
    8. Nguyen, Kien Trung & Hung, Nguyen Thanh, 2021. "The minmax regret inverse maximum weight problem," Applied Mathematics and Computation, Elsevier, vol. 407(C).
    9. Zeynep Erkin & Matthew D. Bailey & Lisa M. Maillart & Andrew J. Schaefer & Mark S. Roberts, 2010. "Eliciting Patients' Revealed Preferences: An Inverse Markov Decision Process Approach," Decision Analysis, INFORMS, vol. 7(4), pages 358-365, December.
    10. Chassein, André & Goerigk, Marc, 2018. "Variable-sized uncertainty and inverse problems in robust optimization," European Journal of Operational Research, Elsevier, vol. 264(1), pages 17-28.
    11. Vincent Mousseau & Özgür Özpeynirci & Selin Özpeynirci, 2018. "Inverse multiple criteria sorting problem," Annals of Operations Research, Springer, vol. 267(1), pages 379-412, August.
    12. Tomer Blumkin & Leif Danziger & Eran Yashiv, 2017. "Optimal unemployment benefit policy and the firm productivity distribution," International Tax and Public Finance, Springer;International Institute of Public Finance, vol. 24(1), pages 36-59, February.
    13. T. R. Wang & N. Pedroni & E. Zio & V. Mousseau, 2020. "Identification of Protective Actions to Reduce the Vulnerability of Safety‐Critical Systems to Malevolent Intentional Acts: An Optimization‐Based Decision‐Making Approach," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 565-587, March.
    14. Chen, Lu & Chen, Yuyi & Langevin, André, 2021. "An inverse optimization approach for a capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1087-1098.
    15. Bucarey, Víctor & Labbé, Martine & Morales, Juan M. & Pineda, Salvador, 2021. "An exact dynamic programming approach to segmented isotonic regression," Omega, Elsevier, vol. 105(C).
    16. Xiyuan Ren & Joseph Y. J. Chow, 2023. "Nonparametric estimation of k-modal taste heterogeneity for group level agent-based mixed logit," Papers 2309.13159, arXiv.org.
    17. Ren, Xiyuan & Chow, Joseph Y.J., 2022. "A random-utility-consistent machine learning method to estimate agents’ joint activity scheduling choice from a ubiquitous data set," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 396-418.
    18. Mintz, Yonatan & Aswani, Anil & Kaminsky, Philip & Flowers, Elena & Fukuoka, Yoshimi, 2023. "Behavioral analytics for myopic agents," European Journal of Operational Research, Elsevier, vol. 310(2), pages 793-811.
    19. András Kovács, 2021. "Inverse optimization approach to the identification of electricity consumer models," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 521-537, June.
    20. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.

    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:eee:ejores:v:293:y:2021:i:1:p:36-49. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.