IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v34y2022i2p807-816.html
   My bibliography  Save this article

JANOS: An Integrated Predictive and Prescriptive Modeling Framework

Author

Listed:
  • David Bergman

    (Department of Operations and Information Management, School of Business, University of Connecticut, Storrs, Connecticut 06268)

  • Teng Huang

    (Lingnan (University) College, Sun Yat-sen University, Guangzhou 510275, China)

  • Philip Brooks

    (Optimized Operations, LLC, Boston, Massachusetts 02116)

  • Andrea Lodi

    (CERC and MAGI, Polytechnique Montréal, Montréal, Québec H3C 3A7, Canada)

  • Arvind U. Raghunathan

    (Mitsubishi Electric Research Laboratories, Cambridge, Massachusetts 02139)

Abstract

Business research practice is witnessing a surge in the integration of predictive modeling and prescriptive analysis. We describe a modeling framework JANOS that seamlessly integrates the two streams of analytics, allowing researchers and practitioners to embed machine learning models in an end-to-end optimization framework. JANOS allows for specifying a prescriptive model using standard optimization modeling elements such as constraints and variables. The key novelty lies in providing modeling constructs that enable the specification of commonly used predictive models within an optimization model, have the features of the predictive model as variables in the optimization model, and incorporate the output of the predictive models as part of the objective. The framework considers two sets of decision variables: regular and predicted . The relationship between the regular and the predicted variables is specified by the user as pretrained predictive models. JANOS currently supports linear regression, logistic regression, and neural network with rectified linear activation functions. In this paper, we demonstrate the flexibility of the framework through an example on scholarship allocation in a student enrollment problem and provide a numeric performance evaluation. Summary of Contribution. This paper describes a new software tool, JANOS, that integrates predictive modeling and discrete optimization to assist decision making. Specifically, the proposed solver takes as input user-specified pretrained predictive models and formulates optimization models directly over those predictive models by embedding them within an optimization model through linear transformations.

Suggested Citation

  • David Bergman & Teng Huang & Philip Brooks & Andrea Lodi & Arvind U. Raghunathan, 2022. "JANOS: An Integrated Predictive and Prescriptive Modeling Framework," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 807-816, March.
  • Handle: RePEc:inm:orijoc:v:34:y:2022:i:2:p:807-816
    DOI: 10.1287/ijoc.2020.1023
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.1023
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2020.1023?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
    ---><---

    References listed on IDEAS

    as
    1. Alice Paul & Jacob Feldman & James Mario Davis, 2018. "Assortment Optimization and Pricing Under a Nonparametric Tree Choice Model," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 550-565, July.
    2. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, 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. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    2. Fajemisin, Adejuyigbe O. & Maragno, Donato & den Hertog, Dick, 2024. "Optimization with constraint learning: A framework and survey," European Journal of Operational Research, Elsevier, vol. 314(1), pages 1-14.
    3. Tsay, Calvin, 2024. "A Quantile Neural Network Framework for Twostage Stochastic Optimization," DES - Working Papers. Statistics and Econometrics. WS 43773, Universidad Carlos III de Madrid. Departamento de Estadística.

    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. Qi Feng & J. George Shanthikumar, 2022. "Developing operations management data analytics," Production and Operations Management, Production and Operations Management Society, vol. 31(12), pages 4544-4557, December.
    2. Serrano, Breno & Minner, Stefan & Schiffer, Maximilian & Vidal, Thibaut, 2024. "Bilevel optimization for feature selection in the data-driven newsvendor problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 703-714.
    3. Keliang Wang & Leonardo Lozano & Carlos Cardonha & David Bergman, 2023. "Optimizing over an Ensemble of Trained Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 652-674, May.
    4. Meng Qi & Ying Cao & Zuo-Jun (Max) Shen, 2022. "Distributionally Robust Conditional Quantile Prediction with Fixed Design," Management Science, INFORMS, vol. 68(3), pages 1639-1658, March.
    5. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    6. Kameng Nip & Zhenbo Wang & Zizhuo Wang, 2021. "Assortment Optimization under a Single Transition Choice Model," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2122-2142, July.
    7. Barbier, Thibault & Anjos, Miguel F. & Cirinei, Fabien & Savard, Gilles, 2020. "Product-closing approximation for ranking-based choice network revenue management," European Journal of Operational Research, Elsevier, vol. 286(3), pages 1002-1017.
    8. Andrew Butler & Roy Kwon, 2021. "Efficient differentiable quadratic programming layers: an ADMM approach," Papers 2112.07464, arXiv.org.
    9. Liu, Congzheng & Letchford, Adam N. & Svetunkov, Ivan, 2022. "Newsvendor problems: An integrated method for estimation and optimisation," European Journal of Operational Research, Elsevier, vol. 300(2), pages 590-601.
    10. Corredera, Alberto & Ruiz, Carlos, 2023. "Prescriptive selection of machine learning hyperparameters with applications in power markets: Retailer’s optimal trading," European Journal of Operational Research, Elsevier, vol. 306(1), pages 370-388.
    11. Shuaian Wang & Xuecheng Tian, 2023. "A Deficiency of the Predict-Then-Optimize Framework: Decreased Decision Quality with Increased Data Size," Mathematics, MDPI, vol. 11(15), pages 1-9, July.
    12. Toon Vanderschueren & Robert Boute & Tim Verdonck & Bart Baesens & Wouter Verbeke, 2022. "Prescriptive maintenance with causal machine learning," Papers 2206.01562, arXiv.org.
    13. Andrew Butler & Roy H. Kwon, 2021. "Data-driven integration of norm-penalized mean-variance portfolios," Papers 2112.07016, arXiv.org, revised Nov 2022.
    14. Sel, Burakhan & Minner, Stefan, 2022. "A hedging policy for seaborne forward freight markets based on probabilistic forecasts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    15. Jacob Feldman & Alice Paul & Huseyin Topaloglu, 2019. "Technical Note—Assortment Optimization with Small Consideration Sets," Operations Research, INFORMS, vol. 67(5), pages 1283-1299, September.
    16. Rui Chen & Hai Jiang, 2020. "Assortment optimization with position effects under the nested logit model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(1), pages 21-33, February.
    17. Dmitry B. Rokhlin, 2020. "Relative utility bounds for empirically optimal portfolios," Papers 2006.05204, arXiv.org.
    18. Robert Engel & Pablo Fernandez & Antonio Ruiz-Cortes & Aly Megahed & Juan Ojeda-Perez, 2022. "SLA-aware operational efficiency in AI-enabled service chains: challenges ahead," Information Systems and e-Business Management, Springer, vol. 20(1), pages 199-221, March.
    19. Xuecheng Tian & Bo Jiang & King-Wah Pang & Yu Guo & Yong Jin & Shuaian Wang, 2024. "Solving Contextual Stochastic Optimization Problems through Contextual Distribution Estimation," Mathematics, MDPI, vol. 12(11), pages 1-14, May.
    20. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.

    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:inm:orijoc:v:34:y:2022:i:2:p:807-816. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.