{"id":12076,"date":"2026-07-20T10:17:13","date_gmt":"2026-07-20T15:17:13","guid":{"rendered":"https:\/\/meetings.informs.org\/wordpress\/annual\/?page_id=12076"},"modified":"2026-07-20T10:41:31","modified_gmt":"2026-07-20T15:41:31","slug":"tutorials","status":"publish","type":"page","link":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/","title":{"rendered":"TutORials"},"content":{"rendered":"<!--themify_builder_content-->\n<div id=\"themify_builder_content-12076\" data-postid=\"12076\" class=\"themify_builder_content themify_builder_content-12076 themify_builder tf_clear\">\n                    <div  data-zoom-bg=\"desktop\" data-css_id=\"mpfz468\" data-lazy=\"1\" class=\"module_row themify_builder_row fullwidth_row_container tb_mpfz468 tb_first tf_w\">\n            <span  class=\"builder_row_cover tf_abs\" data-lazy=\"1\"><\/span>            <div class=\"row_inner col_align_top tb_col_count_1 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col-full tb_4m4r468 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_rmqh468   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h1 class=\"page-title\">TutORials<\/h1>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_tn6t430 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-2 tb_isy5430 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_xxfv430   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <p>The <em>TutORials in Operations Research<\/em> series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science. These chapters are designed to be accessible for all constituents of the INFORMS community, including current students, practitioners, faculty, and researchers. The publication allows readers to keep pace with new developments in the field and serves as augmenting material for a selection of the tutorial presentations offered at the INFORMS Annual Meeting.<\/p>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-2 tb_8pfa37 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_e16d430 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_0d6i430 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_cz19430   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Generative Models for Decision-Making under Distributional Shift<\/h3>\n<div class=\"ewa-rteLine\">Many data-driven decision problems are formulated using a nominal distribution<br>estimated from historical data, while performance is ultimately determined by<br>a deployment distribution that may be shifted, context-dependent, partially observed,<br>or stress-induced. This tutorial presents modern generative models, particularly flowand<br>score-based methods, as mathematical tools for constructing decision-relevant<br>distributions. From an operations research perspective, their primary value lies not<br>in unconstrained sample synthesis but in representing and transforming distributions<br>through transport maps, velocity fields, score fields, and guided stochastic dynamics.<br>We present a unified framework based on pushforward maps, continuity, Fokker\u2013<br>Planck equations,Wasserstein geometry, and optimization in probability space.Within<br>this framework, generative models can be used to learn nominal uncertainty, construct<br>stressed or least-favorable distributions for robustness, and produce conditional or<br>posterior distributions under side information and partial observation. We also highlight<br>representative theoretical guarantees, including forward\u2013reverse convergence for<br>iterative flow models, first-order minimax analysis in transport-map space, and errortransfer<br>bounds for posterior sampling with generative priors. The tutorial provides<br>a principled introduction to using generative models for scenario generation, robust<br>decision-making, uncertainty quantification, and related problems under distributional<br>shift.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<p><strong>Speakers: Xiuyuan Cheng, Yunqin Zhu, Yao Xie <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_qcoy430 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-qcoy430-0\" class=\"tb_title_accordion\" aria-controls=\"acc-qcoy430-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bios<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-qcoy430-0-content\" data-id=\"acc-qcoy430-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_74nj430\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_w6b5430 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_2m37430   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <p><span style=\"font-weight: bold\">Xiuyuan Cheng<\/span> is a professor of mathematics at Duke University. She received her Ph.D. degree from Princeton University in 2013. Before joining Duke, she was a postdoctoral researcher at \u00c9cole Normale Sup\u00e9rieure in Paris from 2013 to 2015 and a Gibbs Assistant Professor at Yale University from 2015 to 2017.\u00a0Her research interests include theoretical and computational techniques for high-dimensional data\u00a0analysis, signal processing, and machine learning. She is a recipient of a Sloan Fellowship and an\u00a0NSF CAREER Award.<\/p>\n<p><br><strong>Yunqin \u201cVinci\u201d Zhu<\/strong> is a Ph.D. student in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology. He received his B.Eng. degree in artificial intelligence from the University of Science and Technology (USTC) of China. His research interests include machine learning, generative modeling, and optimization. He is a recipient of the Guo Moruo Scholarship from USTC.<\/p>\n<p><strong>Yao Xie<\/strong>\u00a0 is the Coca-Cola\u00a0Foundation Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology, where she is also Associate Director of the Machine Learning Center. She received her Ph.D. degree in electrical engineering, with a minor in mathematics, from Stanford University and was previously a Research Scientist at Duke University.\u00a0Her research lies at the intersection of statistics, machine learning, and optimization, with a focus\u00a0on developing statistically powerful and computationally efficient methods for high-dimensional,\u00a0sequential, and spatio-temporal data. She is a Member of Cohort 2026 of the National Academies\u2019\u00a0New Voices in Sciences, Engineering, and Medicine program and the IEEE Information Theory<br>Society Distinguished Lecturer for 2026\u20132027. Her honors include the NSF CAREER Award,<br>INFORMS Wagner Prize Finalist, INFORMS Gaver Early Career Award, and C.W.S. Woodroofe<br>Award. She serves as an associate editor for several journals, including IEEE Transactions on<br>Information Theory, Journal of the American Statistical Association\u2014Theory and Methods, Operations\u00a0Research, Annals of Applied Statistics, Sequential Analysis, and INFORMS Journal on Data\u00a0Science.<\/p>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_du7k430 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_ahdt498 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_bc3l498 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_kzbf498   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Transform Method for Stochastic Processing and Matching Networks<\/h3>\n<div class=\"ewa-rteLine\">Modern service systems\u2014ranging from cloud data centers and ride-hailing platforms to healthcare facilities\u2014operate at massive scales where congestion is a critical challenge. Utilizing an operations research approach, these systems are analyzed by modeling them as complex stochastic processes, which are typically understood through process-level convergence to fluid and diffusion limits. However, these methods often prove technically dense and provide limited guidance for finite, practical system scales.<\/div>\n<div class=\"ewa-rteLine\">The transform method, presented in this tutorial, was recently developed as a unified and tractable framework for the steady-state analysis of Stochastic Processing and Matching Networks (SPNs\/SMNs). The transform method overcomes the technical hurdles<\/div>\n<div class=\"ewa-rteLine\">of process-level convergence by working directly with the pre-limit system. By exploiting the zero-drift property of exponential test functions, the method derives explicit functional equations (acting as a proxy for global balance equations) for the transforms<\/div>\n<div class=\"ewa-rteLine\">(such as moment-generating functions) of queue-length distributions. This approach provides sharp, non-asymptotic performance guarantees, bridging the gap between theoretical asymptotics and real-world system behavior. Since its introduction in 2020 for load-balancing in data center networks, the transform method has been extended to handle realistic complexities, including customer abandonment, state-dependent arrivals, Markov-modulated arrivals, large-system scale, and multi-dimensional networks with multiple bottlenecks. We survey these theoretical advances and demonstrate their practical relevance across diverse domains, such as matching markets and networked service systems. The transform method provides<\/div>\n<div class=\"ewa-rteLine\">interpretable bounds tied directly to system parameters, offering a powerful analytical alternative to simulation-heavy or purely asymptotic approaches for system design and control.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<p><strong>Speakers: Sushil\u202fVarma, Prakirt Jhunjhunwala, Daniela Hurtado-Lange, Siva Theja Maguluri <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_6ciz498 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-6ciz498-0\" class=\"tb_title_accordion\" aria-controls=\"acc-6ciz498-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-6ciz498-0-content\" data-id=\"acc-6ciz498-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_4nxg498\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_fra4498 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_psqo498   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\"><strong>Sushil Mahavir Varma<\/strong> is an assistant professor in the Industrial and Operations Engineering Department at the University of Michigan, Ann Arbor. Before joining Michigan, he was a postdoctoral researcher at INRIA Paris. He received his PhD degree in operations research from Georgia Institute of Technology. His research lies broadly in applied probability. He has worked on problems spanning two-sided matching markets, electric vehicle operations, queueing theory, load balancing, and graph alignment. His work has been recognized with the 2024 ACM SIGMETRICS Doctoral Dissertation Award, the 2025 Georgia Tech Sigma Xi Best PhD Thesis Award, and finalist recognition for the 2025 INFORMS TSL Dissertation Award.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Siva Theja Magulur<\/strong>i is Fouts Family Early Career Professor and Associate Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. He received his B.Tech in Electrical Engineering from IIT Madras, M.S in ECE, M.S. in Applied Math and a PhD in ECE all from University of Illinois at Urbana Champaign. His research interests span the areas of Networks, Control, Optimization, Algorithms, Applied Probability and Reinforcement Learning. He is a recipient of the biennial \u201cBest Publication in Applied Probability\u201d award, NSF CAREER award, \u201cCTL\/BP Junior Faculty Teaching Excellence Award,\u201d and \u201cStudent Recognition of Excellence in Teaching: Class of 1934 CIOS Award.\u201d<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Prakirt Jhunjhunwala<\/strong> is a Postdoctoral Scientist at Amazon in the FBA Science team. Previously, he was a Postdoctoral Research Scholar at Columbia Business School, New York. He received his Ph.D. in Operations Research and a Masters in Mathematics from Georgia Tech in 2023 and his B.Tech. (Honors) in Electrical Engineering from IIT Bombay. His research focuses on the design and analysis of stochastic networks, with applications in data centers and quantum networks. Prakirt received an Honorable Mention for the SIGMETRICS Doctoral Dissertation Award (2023), the Best Paper Award at SPCOM (2018), and the Ed Iacobucci Fellowship for Excellence in Applied Probability and Simulation (2022).<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Daniela Hurtado-Lange<\/strong> is an assistant professor in the Operations Department at the Kellogg School of Management at Northwestern University. Before joining Kellogg, she was an assistant professor of Mathematics at William &amp; Mary for 1.5 years. She obtained her Ph.D. in Operations Research from Georgia Tech in December 2021, and her research focuses on performance analysis of stochastic processing networks. Specifically, she works on heavy-traffic analysis and queueing theory. Her work has been recognized with the 2022 Sigma Xi Best Ph.D. Thesis Award, and second place in the 2020 JFIG competition.<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_luue498 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_9hhq349 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_jwf3349 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_hgtw349   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Multi-objective Combinatorial Optimization: Foundations, Theory, and Methods<\/h3>\n<p>This tutorial presents the foundations, theory and methods of multiobjective<br>integer programming, with a particular focus on multi-objective combinatorial<br>optimization (MOCO). Many real-world optimization problems are inherently<br>combinatorial in nature and involve multiple, often conflicting, objectives. MOCO has<br>been widely used to model these complex decision problems across various domains<br>such as transportation, logistics, finance, energy, and healthcare. While the feasible<br>set is typically finite in MOCO problems, these solutions are not always explicitly<br>available to the decision-makers. Adding to this complexity, there is rarely a single<br>solution that optimizes all objectives simultaneously in multi-objective optimization<br>problems. This tutorial provides a structured framework for students, researchers, and<br>practitioners to approach and solve these complex decision problems. We first define<br>key terminology, describe the main characteristics of MOCO problems and discuss<br>their scalarization. We then explore the advanced methods and exact algorithms to<br>generate all nondominated points, for which an improvement in one objective cannot<br>be made without sacrificing performance in another. Since these algorithms become<br>intractable in real-world problem settings with the increase in the number of nondominated<br>points, we also discuss the methods that generate a representative set of<br>solutions with a prespecified level of quality or find preferred solutions. The tutorial<br>provides a broad and accessible overview of existing methods, supported by illustrative<br>examples, discussions, figures, and comprehensive references that clarify their<br>main ideas, strengths, and limitations.<\/p>\n<p><strong>Speaker: Banu Lokman <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_wavk349 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-wavk349-0\" class=\"tb_title_accordion\" aria-controls=\"acc-wavk349-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-wavk349-0-content\" data-id=\"acc-wavk349-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_b91p349\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_cesr349 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_ibqg349   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Banu Lokman<\/strong> is a Professor of Operational Research in the School of Organisations, Systems and People at the University of Portsmouth, United Kingdom. She completed her PhD in Industrial Engineering at Middle East Technical University (METU) in Turkey and held academic and research positions at METU and the Aalto University School of Business in Finland. She currently serves as the President of the INFORMS Section on Multiple Criteria Decision Making (MCDM), having previously held board positions in the International Society on MCDM and\u00a0the INFORMS MCDM Section. She is an Associate Editor for Omega and the IMA Journal of\u00a0Management Mathematics and is an editorial board member of the Journal of Multi-Criteria\u00a0Decision Analysis. She is also a member of the Research Committee of the UK Operational\u00a0Research Society and leads UK-based MCDM courses at NATCOR. In 2022, she received the\u00a0Bernard Roy Award from the Association of European Operational Research Societies (EURO)\u00a0Working Group on Multiple Criteria Decision Aiding for her contributions to the field. Her research\u00a0interests include MCDM, combinatorial optimization, multi-objective integer and mixedinteger\u00a0programming, clustering, and applications in energy, sustainability, and healthcare. Her\u00a0work has been published in several peer-reviewed journals, including Management Science and\u00a0European Journal of Operational Research.<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_ozfd349 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_ibbp348 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_z9d1348 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_tcwd348   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>A Modern Treatment of the Primal\u2013Dual Framework for Online Resource Allocation<\/h3>\n<p>Linear-programming (LP)-based primal\u2013dual methods are fundamental for designing and analyzing algorithms in adversarial (prior-free) online resource allocation. This chapter provides a tutorial on two modern primal-dual frameworks, emphasizing recent developments and contemporary models in operations research. Part I develops an LP-based convex-programming framework where solving a regularized convex program at each arrival captures the tradeoff between greediness and hedging, yielding a dual certificate via Karush\u2013Kuhn\u2013Tucker (KKT) conditions. Because standard LP relaxations can be weak or intractable for stochastic outcomes, Part II introduces a complementary LP-free framework that provides a universal certificate system for evaluating competitive ratios under such uncertainty. Covering a wide array of models\u2014including online vertex-weighted bipartite matching, edge-weighted online matching with free disposal, online matching with stochastic rewards, reusable resources, two-sided assortment optimization, configuration allocation (whole-page optimization), AdWords, and costly cancellations\u2014the tutorial equips readers with versatile proof templates to analyze existing algorithms and develop new solutions for emerging applications.<\/p>\n<p><strong>Speakers: Rad Niazadeh, Rajan Udwani<\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_rz3g348 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-rz3g348-0\" class=\"tb_title_accordion\" aria-controls=\"acc-rz3g348-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-rz3g348-0-content\" data-id=\"acc-rz3g348-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_h7gn348\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_lb5v348 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_8a3h348   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\"><strong>Rad Niazadeh<\/strong> is an Associate Professor of Operations Management at the University of Chicago Booth School of Business. He is also part of the faculty at Toyota Technological Institute of Chicago (TTIC) by a courtesy appointment, and a faculty advisor at Lyft Inc. (Fulfillment &amp; Matching Science). Prior to joining Chicago Booth, he was a visiting researcher at Google Research NYC and a Motwani postdoctoral fellow at Stanford University, Computer Science Department. He obtained his PhD in Computer Science (minored in Applied Mathematics) from Cornell University. His research spans online algorithms, online learning, and mechanism design, with applications in theory and practice of online platforms and non-profit operations. His work has received multiple recognitions including the INFORMS Auctions and Market Design Rothkopf Junior Researcher Paper Award (2021, 2024: first place; 2023: second place), the INFORMS Revenue Management and Pricing Dissertation Award (honorable mention), and best student paper awards at INFORMS George Nicholson Competition (2025: honorable mention), INFORMS MSOM (2024), INFORMS Service Science (2025: finalist), INFORMS Data Mining, and IJCAI conference.<\/div>\n<div>\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Rajan Udwani<\/strong> is an Assistant Professor of Industrial Engineering and Operations Research at the University of California, Berkeley. His research focuses on algorithms for optimization under uncertainty, with a particular emphasis on revenue management and pricing. Before joining UC Berkeley, he was a postdoctoral researcher at Columbia University. He holds a Ph.D. in Operations Research from MIT and a B.Tech. in Electrical Engineering from IIT Bombay. His work has been recognized with INFORMS junior faculty and student paper awards, and is supported by an NSF CAREER Award and the Google Research Scholar Program.<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_2sn8348 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_i9g7780 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_ko2f780 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_scw0780   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Self-Adapting Approximations of Markov Decision Processes: A Guided Tour<\/h3>\n<p>Sequential decision making under uncertainty arises across business, engineering, and science. Markov Decision Processes (MDPs) offer a rich modeling language, but translating models into implementable policies requires confronting challenging state and action spaces and non-convex optimization landscapes. Approximations are essential, and making them accessible and performant without algorithmic expertise allows users to focus on formulating MDPs that capture real-world features rather than\u00a0simplifying their models to facilitate solution. Obtaining a policy involves a three-stage COR cycle: Constructing a parametrized model that approximates the MDP, Optimizing for the parameters of this model, and Refining the model by learning from the<br>solution. These stages involve design choices that burden the user, leading them to simplify or skip stages.<\/p>\n<p>This tutorial provides an overview of methods that reduce the user burden using COR as its guide. Construction ranges from lightweight extensible models to automated structural reformulations. Optimization leverages mathematical programming and firstorder methods that have matured in theory and off-the-shelf software. Refinement performs feature expansion and approximation tightening, feeding back into the construct stage. When a combination of techniques across COR stages results in both accessibility and performance, we refer to it as a self-adapting approximation. Such an approximation adapts to problem structure, instance data, or solution progress. We guide readers through these ideas across weakly coupled MDPs and general continuous state-action MDPs, providing generalizable foundations and a code base to get started on a simple example. The tutorial concludes by outlining the potential for foundation models and quantum computing to further impact this area.<\/p>\n<p><strong>Speakers: Andre Augusto Cire, Selvaprabu Nadarajah, Parshan Pakiman, Negar Soheili <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_a6i6780 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-a6i6780-0\" class=\"tb_title_accordion\" aria-controls=\"acc-a6i6780-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-a6i6780-0-content\" data-id=\"acc-a6i6780-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_rg08780\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_rxfi780 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_ty77780   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\">\n<p><strong>Andre A. Cire<\/strong> is an Associate Professor of Operations Management and Analytics at the University of Toronto, cross-appointed between the Rotman School of Management and the Department of Management at the Scarborough campus. His research bridges methodological development and practical applications in optimization, with a focus on sequential decision-making, mathematical programming, dynamic programming, network models, and applications in scheduling, healthcare, and supply chains. Andre earned his PhD in Operations Research from Carnegie Mellon University, and his contributions have been recognized with awards such as the INFORMS Harvey J. Greenberg Award (2024), an honorable mention for the INFORMS Computing Society Prize (2023), and research and teaching awards at the University of Toronto. He has also held senior editorial and service roles for multiple journals and conferences including INFORMS Journal on Computing, AAAI, and NeurIPS.<\/p>\n<p><strong>Selvaprabu (Selva) Nadarajah<\/strong> is an Associate Professor of Information and Decision Sciences and Bielinski Family Endowed Scholar at the College of Business Administration, University of Illinois Chicago (UIC). He is also a UIC Global Scholar and previously served as the Decision Intelligence R&amp;D Lead at the Discovery Partners Institute, the innovation hub of the University of Illinois System. He is an Associate Editor for Decision Sciences, Operations Research, and Production and Operations Management. His research develops self-adapting approximation methods for large-scale Markov decision processes. He applies these methods to energy investment and operations problems, including real options valuation of commodity and energy assets, renewable energy procurement, and capacity expansion. This work has been recognized with awards from INFORMS, the Commodity and Energy Markets Association, and NeurIPS. It has been funded by the Alfred P. Sloan Foundation, Argonne National Laboratory, and industry. He has received the UIC College of Business Teaching Excellence Award and the EnergyTech University Prize Faculty Explorer Award from the U.S. Department of Energy for educational initiatives. He holds a PhD in Operations Research from the Tepper School of Business at Carnegie Mellon University.<\/p>\n<p><strong>Parshan Pakiman<\/strong> is an Assistant Professor in the Department of Operations Management and Strategy at the University at Buffalo School of Management. His research focuses on approximate dynamic programming and data-driven optimization methods for sequential decision making, with an emphasis on large-scale Markov decision processes and structured relaxations. His work develops algorithms with strong theoretical guarantees that minimize the need for human intervention during deployment, including model selection and parameter tuning. These methods are designed to be scalable, interpretable, and accessible to practitioners, with applications in healthcare operations and revenue management. Prior to joining the University at Buffalo, he was a Principal Researcher at the Tolan Center for Healthcare at the University of Chicago Booth School of Business. He received his PhD in Information and Decision Sciences from the University of Illinois Chicago and his BSc in Applied Mathematics from the University of Tehran.<\/p>\n<p><strong>Negar Soheili<\/strong> is an Associate Professor in the Department of Information and Decision Sciences at the University of Illinois Chicago. She received her PhD in Operations Research from Carnegie Mellon University. Her research develops scalable optimization algorithms for machine learning and sequential decision-making under uncertainty. In particular, she designs efficient first-order methods for large-scale constrained optimization and the approximation of Markov decision processes, with applications in healthcare, supply chains, and business analytics. She launched the PhD program in Operations Research and Business Analytics at UIC. She serves as an Associate Editor for the INFORMS Journal on Computing and for Optimization Letters.<\/p>\n<p>&#8220;<\/p>\n<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_t58c780 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_wjq8880 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_ll06880 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_tyab880   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>A Tutorial on Reinforcement Learning for LLMs: RLHF and Beyond<\/h3>\n<p>coming soon<\/p>\n<p><strong>Speaker: Daniel Jiang<\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_4d80880 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_sydq757 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_bqj7757 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_u9z5880   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Foundations of Reinforcement Learning and Control: Connections and New Perspective<\/h3>\n<p>coming soon<\/p>\n<p><strong>Speakers: Claire Vernade, Onno Eberhard Max, Martha White, Florian D\u00f6rfler, Csaba Szepevari, Miroslav Krstic, Michael Muehlebach<\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_blep757 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_bz9v541 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_e8gc541 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_3etw541   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Decision-Focused Learning: When and Why Traditional Prediction Models Fail<\/h3>\n<p>Plugging predictions of unknown parameters into downstream optimization<br>problems, often referred to as the \u201cpredict-then-optimize\u201d paradigm, has long<br>been a standard approach in decision-making under uncertainty. However, improved<br>predictive accuracy does not, in general, translate into improved decision quality.<br>This disconnect has motivated growing interest in decision-focused learning (DFL)<br>within the operations research community. This tutorial reviews recent developments<br>in DFL and highlights key methodological insights, with a particular focus on stochastic<br>linear programming as the downstream decision-making problem.We discuss why<br>several widely used tools in traditional statistical learning are not directly suited to<br>decision-focused settings and must be rethought, including (i) data collection strategies<br>driven purely by predictive uncertainty and (ii) distributional distance measures<br>such as the Wasserstein distance. We summarize properties of DFL that distinguish it<br>from conventional predictive modeling and provide insights into the development of<br>new decision-focused tools.<\/p>\n<p><strong>Speaker: Mo Liu<\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_xc96541 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-xc96541-0\" class=\"tb_title_accordion\" aria-controls=\"acc-xc96541-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-xc96541-0-content\" data-id=\"acc-xc96541-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_z618541\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_97et541 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_xgfk541   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <p><strong>Mo Liu<\/strong> is an assistant professor in the Department of Statistics and Operations Research at the University of North Carolina at Chapel Hill. He received his PhD in Industrial Engineering and Operations Research from the University of California, Berkeley. His research centers on decision-focused learning, a methodology that designs and trains prediction models while accounting for downstream optimization problems. These downstream problems arise in real-world applications such as revenue and inventory management.<\/p>\n    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_dpp2541 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_0usu246 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_lnob246 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_q6oq246   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Fraud Analytics as a Sequential Decision System: Integrating Machine Learning, Optimization, and Adversarial Learning<\/h3>\n<div class=\"ewa-rteLine\">Fraud analytics is fundamentally a decision problem under uncertainty,<br>involving trade-offs between detection performance, investigation costs, and operational<br>constraints. While statistical and machine learning models are widely used to<br>detect anomalous behavior and estimate fraud risk, they are often deployed without<br>explicit consideration of downstream decisions, strategic adaptation, and system-level<br>dynamics. This tutorial presents a unified framework that reframes fraud analytics<br>as a sequential decision system involving adaptive and adversarial agents. We review<br>descriptive and predictive models, and embed them within a decision-theoretic framework<br>that captures trade-offs between false positives, false negatives, and resource<br>constraints. We further introduce adversarial risk analysis and related approaches to<br>model strategic interactions between fraudsters and detection systems. By connecting<br>prediction, optimization, and adversarial modeling, the tutorial highlights how decisions<br>influence both operational outcomes and future data through feedback effects.<br>This sequential perspective emphasizes the need for adaptive policies that account<br>for evolving fraud behavior and changing system conditions. Examples from health<br>care and financial fraud illustrate how analytical models support real-world decisionmaking<br>and resource allocation in high-stakes environments. Intended for researchers<br>and practitioners across operations research, statistics, and data science, this tutorial<br>provides an accessible synthesis that requires no prior background. By the end, the<br>reader will understand howto frame fraud detection as a decision problem, evaluate the<br>limitations of purely predictive approaches, and reason about adversarial adaptation<br>within a unified sequential framework applicable across fraud domains.<\/div>\n<div>\u00a0<\/div>\n<p><strong>Speaker: Tahir Ekin<\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_r8rm246 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-r8rm246-0\" class=\"tb_title_accordion\" aria-controls=\"acc-r8rm246-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-r8rm246-0-content\" data-id=\"acc-r8rm246-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_dc5i246\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_ha4j246 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_x0ok246   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\"><strong>Tahir Ekin<\/strong>\u00a0is Fields Chair in Business Analytics and Professor of Analytics at Texas State University, where he also serves as the founding Director of the Center for Analytics and Data Science (TXST CADS). His research focuses on probabilistic modeling, statistical learning, decision-making under uncertainty, adversarial machine learning, and fraud analytics, with applications in health care. He is the author of &#8220;Statistics and Health Care Fraud: How to Save Billions&#8221; (ASA\u2013CRC Press). His work has been supported by the National Science Foundation, Air Force Office of Scientific Research, and Texas Health and Human Services. He holds a Ph.D. in Decision Sciences from The George Washington University.<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_qa38246 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_jn7q491 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_dgo3491 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_kmvg491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers<\/h3>\n<p>Artificial intelligence (AI) is moving beyond prediction toward systems<br>supporting decisions in complex, dynamic environments. This shift creates a natural<br>intersection with operations research and management science (OR\/MS), which<br>has long provided methodological foundations for sequential decision making under<br>uncertainty. At the same time, deep learning advances, including feedforward neural<br>networks, recurrent architectures, transformers, large language models (LLMs),<br>and deep reinforcement learning, have expanded data-driven modeling for large-scale<br>decisions. This tutorial presents an OR\/MS-centered perspective on deep learning<br>for sequential decision making under uncertainty, bridging neural architectures and<br>OR\/MS approaches to decision making. Its premise: deep learning complements<br>optimization rather than replacing it. Deep learning brings adaptability and scalable<br>approximation, whereas OR\/MS provides the mathematical rigor to represent constraints,<br>recourse, uncertainty, and decision quality. The tutorial reviews key decision<br>making foundations, connects them to the major neural architectures in modern AI, and<br>organizes the field around three central themes: predict-then-optimize and decisionaware<br>learning, learning-based decision generation under constraints for continuous<br>and discrete problems with temporal coupling, and deep reinforcement learning for<br>sequential and combinatorial decision making. Impact spans supply chains, service<br>systems, healthcare and epidemic response, agriculture, energy, environmental sustainability,<br>and autonomous operations. This tutorial frames these developments as<br>part of a shift from predictive AI toward decision-capable AI, highlighting OR\/MS\u2019s<br>role in shaping the next generation of integrated learning\u2013optimization systems.<\/p>\n<p><strong>Speaker: Esra B\u00fcy\u00fcktahtak\u0131n Toy <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_c3j1491 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-c3j1491-0\" class=\"tb_title_accordion\" aria-controls=\"acc-c3j1491-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-c3j1491-0-content\" data-id=\"acc-c3j1491-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_tydl491\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_0e56491 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_k5rx491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\">\n<p><strong>Esra B\u00fcy\u00fcktahtak\u0131n<\/strong>\u00a0is a Full Professor of Operations Research in the Grado Department of Industrial and Systems Engineering at Virginia Tech, where she directs the Systems\u00a0Optimization and Machine Learning Lab (SysOptiMaL). She earned her Ph.D. in Operations\u00a0Research from the University of Florida. Her research advances multi-stage stochastic mixedinteger\u00a0programming through optimization theory, algorithmic innovation, and learning-enhanced\u00a0optimization. She is recognized for pioneering contributions at the interface of deep learning and\u00a0optimization for sequential decision making under uncertainty. Her work bridges operations research,\u00a0machine learning, and artificial intelligence, with applications in health systems, epidemic\u00a0supply chains, biosecurity, defense, ecological conservation, agriculture, forestry, and environmental\u00a0sustainability.<\/p>\n<p>Dr. B\u00fcy\u00fcktahtak\u0131n is the recipient of the National Science Foundation (NSF) CAREER Award (2016) and the INFORMS Minority Issues Forum (MIF) Early Career Award (2016), and her research\u00a0has been supported by NSF, the U.S. Department of Agriculture (USDA), the Office of Naval Research (ONR), the U.S. Forest Service, the Virginia Department of Forestry, the Minnesota\u00a0Aquatic Invasive Species Research Center (MAISRC), and the 4-VA Collaborative Research\u00a0Program, with more than $3 million in external funding. She has authored 49 peer-reviewed journal\u00a0publications in leading scholarly outlets, including 27 papers in A* and A ranked journals. Her\u00a0work has received six INFORMS Best Publication Awards and has been featured three times in\u00a0ISE Magazine, as well as in the INFORMS Computing Society and U.S. Forest Service newsletters.\u00a0Her professional service includes leadership in the INFORMS community, where she served\u00a0as President of the INFORMS Junior Faculty Interest Group (JFIG, 2014\u20132015) and received two\u00a0INFORMS Service Awards. She currently serves as an Associate Editor of the INFORMS Journal\u00a0on Computing.<\/p>\n<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_ymt7491 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_381r279 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_zabt279 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_dcng491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Multiagent Online Learning in Dynamic and Uncertain Environments<\/h3>\n<div class=\"ewa-rteLine\">Multiagent online learning studies how multiple decision-making agents<\/div>\n<div class=\"ewa-rteLine\">adapt their behavior over time in response to strategic interaction, uncertainty, and<\/div>\n<div class=\"ewa-rteLine\">non-stationary environments created by other adaptive agents. Such settings arise naturally<\/div>\n<div class=\"ewa-rteLine\">in large-scale engineered and socio-technical systems, including transportation<\/div>\n<div class=\"ewa-rteLine\">networks, energy markets, financial systems, supply chains, and emerging agentic AI<\/div>\n<div class=\"ewa-rteLine\">platforms, where agents may be any combination of humans, algorithms, or physical<\/div>\n<div class=\"ewa-rteLine\">systems. This article presents a tutorial overviewof learning in games and evolutionary<\/div>\n<div class=\"ewa-rteLine\">game theory as a foundational framework for modeling and analyzing these interactions.<\/div>\n<div class=\"ewa-rteLine\">We introduce core game-theoretic concepts and discuss how these outcomes<\/div>\n<div class=\"ewa-rteLine\">may emerge under adaptive learning dynamics, along with selected impossibility<\/div>\n<div class=\"ewa-rteLine\">results that capture obstacles to these outcomes. Representative discrete-time and<\/div>\n<div class=\"ewa-rteLine\">continuous-time learning algorithms and their connections are reviewed alongside<\/div>\n<div class=\"ewa-rteLine\">their convergence and long-run properties. The tutorial further presents learning for<\/div>\n<div class=\"ewa-rteLine\">stochastic and Markov game settings, drawing connections to multiagent reinforcement<\/div>\n<div class=\"ewa-rteLine\">learning and illustrating how strategic-form learning results can be leveraged in<\/div>\n<div class=\"ewa-rteLine\">this generalized setting.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<p><strong>Speakers: Ceyhun Eksin, Jeff S. Shamma, Behrouz Touri <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_pwlm491 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-pwlm491-0\" class=\"tb_title_accordion\" aria-controls=\"acc-pwlm491-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-pwlm491-0-content\" data-id=\"acc-pwlm491-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_ndz1491\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_atiu491 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_9z8o491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\"><strong>Ceyhun Eksin <\/strong>is an Associate Professor with the Department of Industrial and Systems Engineering, Texas A&amp;M\u00a0University, College Station, TX, USA. He received the B.Sc. degree in Control Engineering from Istanbul Technical University, Istanbul, Turkey, in 2005, the M.S. degree in Industrial Engineering from Bogazi\u00e7iUniversity, Istanbul, in 2008, the M.A. degree in statistics from the Wharton Statistics Department, and the Ph.D. degree in Electrical and Systems Engineering from University of Pennsylvania, in 2015. He was a Post-Doctoral Researcher jointly affiliated with the School of Biological Sciences and the School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA. He was a recipient of the NSF CAREER Award in 2023. His research interests include networks, game theory, control theory, and distributed optimization.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Jeff Shamma<\/strong> is the Department Head of Industrial and Enterprise Systems Engineering and Jerry S. Dobrovolny Chair at the University of Illinois Urbana-Champaign. He previously held faculty positions at the King Abdullah University of Science and Technology (KAUST) and at Georgia Tech as the Julian T. Hightower Chair in Systems and Controls. Jeff received a PhD in Systems Science and Engineering from MIT in 1988. He is a Fellow of IEEE and IFAC, a past Distinguished Lecturer of the IEEE Control Systems Society, and a recipient of the IFAC High Impact Paper Award, AACC Donald P. Eckman Award, and NSF Young Investigator Award. Jeff has been a plenary\/semi-plenary speaker at NeurIPS, World Congress of the Game Theory Society, and IEEE Conference on Decision and Control. He was Editor-in-Chief of the IEEE Transactions on Control of Network Systems from 2020-2024. Jeff\u2019s research focuses on decision and control, game theory, and multi-agent systems.<\/div>\n<div class=\"ewa-rteLine\">\u00a0<\/div>\n<div class=\"ewa-rteLine\"><strong>Behrouz Touri <\/strong>is an Associate Professor of the Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign (UIUC) and an affiliate faculty of the ECE Departments at UIUC and University of California, San Diego (UCSD). Prior to joining UIUC, he was an Associate Professor of ECE at the UCSD. He received his B.Sc. degree in Electrical Engineering from Isfahan University of Technology, Isfahan, Iran in 2006, his M.Sc. degree in Communications, Systems, Electronics from Jacobs University, Bremen, Germany in 2008, and his Ph.D. degree in Industrial Engineering from University of Illinois at Urbana-Champaign in 2011. His research interests include applied probability theory, distributed optimization, control and estimation, population dynamics, and game<\/div>\n<div class=\"ewa-rteLine\">theory.<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_jdpk279 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_1r0j862 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_4k23862 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_9de5491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>Parallel Computing for Two-Stage Stochastic Infrastructure Planning<\/h3>\n<p>Infrastructure planning has become increasingly difficult in recent years as natural hazards affect supply and demand patterns as well as the network of equipment\u00a0connecting the two. In order to plan coordinated infrastructure systems that are resilient to a variety of potential threats, it is necessary to represent these systems at sufficiently\u00a0high resolution to capture geographic and temporal variations as well as uncertainty. Both of these factors translate into much larger optimization problems than have\u00a0traditionally been considered, and solving these problems is at the frontier of what is computationally feasible. Parallel computing is a tool to push that frontier.<br>In this tutorial, we present methods for solving large-scale two-stage stochastic<br>mixed-integer linear programming (MILP) problems using high-performance computing<br>(HPC) resources, with a focus on infrastructure planning problems. To this end,<br>we cover the necessary basics of modeling stochastic infrastructure planning problems<br>and leveraging parallel computing resources to solve stochastic MILPs. We discuss<br>decomposition algorithms and their parallel implementation in the Python package<br>mpi-sppy and present examples of how to use this tool to solve stochastic infrastructure<br>planning problems. Finally, we present an example of how mpi-sppy has<br>been used to solve a realistically sized power system expansion planning problem for<br>California to demonstrate the difficulty of solving large-scale, stochastic, infrastructure<br>planning problems and how HPC resources can be leveraged to solve such problems.<\/p>\n<p><strong>Speakers: T<span class=\"NormalTextRun SCXW139913627 BCX0\">om\u00e1s Valencia Zuluaga<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">,\u00a0<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">Elizabeth Glist<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">a,\u00a0<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">Amelia Musselman<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">,<\/span><span class=\"NormalTextRun SCXW139913627 BCX0\">\u00a0and Jean-Paul Watson<\/span> <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_bvm5491 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-bvm5491-0\" class=\"tb_title_accordion\" aria-controls=\"acc-bvm5491-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-bvm5491-0-content\" data-id=\"acc-bvm5491-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_c72u491\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_gjmg491 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_yad8491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <p><strong>Elizabeth Glista<\/strong>\u00a0is a research scientist at Lawrence Livermore National Laboratory (LLNL). Her research focuses on optimization problems with applications to power system planning, operation, and resilience, including large-scale stochastic planning and non-convex operational problems. At LLNL, she has contributed to internal research projects and to work supported by the U.S. Department of Energy\u2019s Office of Electricity through the Advanced Grid Modeling (AGM) and North American Energy Resilience Model (NAERM) projects. She holds a PhD and an MS in Mechanical Engineering, Controls, from the University of California, Berkeley (2023, 2018) and a BS in Mechanical Engineering from the Massachusetts Institute of Technology (2017). Her work has been recognized with the IEEE Power &amp; Energy Society General Meeting Best Conference Paper Award (2022) and the American Control Conference Best Student Paper Award (2020). Amelia Musselman is an operations research engineer at Lawrence Livermore National Laboratory. She also has experience at Sandia National Laboratories, RAND Corporation, and Pacific Northwest National Laboratory. She holds a Ph.D. in Industrial Engineering and M.S. in Operations Research from Georgia Institute of Technology as well as a B.S. in Mathematics from Harvey Mudd College. Her expertise is in applications of optimization, including multi-objective, stochastic, and robust optimization, to critical infrastructure planning and protection. She has experience working on problems such as stochastic unit commitment, capacity expansion planning, power system and control network restoration, distributed optimization for electric vehicle charging, and other areas of power system planning and protection under uncertainty.<\/p>\n<p><strong>Tomas Valencia Zuluaga<\/strong>\u00a0is a postdoctoral researcher in the Center for Applied Scientific Computing at Lawrence Livermore National Laboratory (LLNL). His research lies at the intersection of optimization and power systems applications, including planning, operation and electricity markets. At LLNL, he has worked on developing high-performance-computing tools for optimal power grid expansion planning under uncertainty. He obtained his PhD in Industrial Engineering and Operations Research (2024) from UC Berkeley, where he received the IEOR Faculty Fellowship award (2023) and Outstanding Graduate Student Instructor Award (2022). He also holds a MS in Electrical Engineering (2018) and BS in Mechatronics Engineering (2014) from Universidad Nacional de Colombia in Bogot\u00e1, and has professional experience in the Oil &amp; Gas and Power sectors in Colombia.<\/p>\n<p><strong>Jean-Paul Watson (&#8220;JP&#8221;)<\/strong>\u00a0is a Distinguished Member of Technical Staff in the Computational Engineering Division (CED) at Lawrence Livermore National Laboratory (LLNL), in Livermore California. At LLNL, he is the Associate Program Lead for Disaster Resilience in the Global Security Directorate. JP leads a diverse team of researchers focused on developing advanced analytics for critical infrastructure operations, planning, and resilience \u2013 emphasizing decision-making under uncertainty. He is co-inventor of the widely used Pyomo algebraic modeling language for mathematical optimization (www.pyomo.org), and has co-authored over 75 journal articles, 30 conference papers, and 3 books. JP has received the R&amp;D 100 award, the INFORMS Computing Society Prize, and was an INFORMS Edelman finalist.<\/p>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_bold862 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n                        <div  data-lazy=\"1\" class=\"module_row themify_builder_row tb_vsxl472 tf_w\">\n                        <div class=\"row_inner col_align_top tb_col_count_2 tf_box tf_rel\">\n                        <div  data-lazy=\"1\" class=\"module_column tb-column col4-3 tb_qhpv472 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_smhv491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <h3>GPU-Accelerated Decision Optimization<\/h3>\n<p>For decades, algorithms for solving decision optimization problems have been designed and implemented for CPUs.\u00a0Recent advances in GPU hardware, driven by machine learning and AI, together with the development of GPU-accelerated scientificcomputing<br>kernels, have made GPUs a practical platform for solving optimization problems. This shift is most visible in linear\u00a0programming, where first-order methods exploit GPU parallelism and high-bandwidth memory to solve problems with millions\u00a0of variables and constraints. GPU algorithms for mixed-integer programming are still emerging, while GPU-based vehicle-routing<br>solvers are more mature and already support large-scale routing applications. At the same time, generative AI and agentic AI\u00a0are changing how optimization models are formulated, solved, and embedded in decision workflows. This tutorial introduces\u00a0GPU-accelerated decision optimization for researchers and practitioners familiar with CPU-based modeling and solvers.We review<br>computational patterns that make optimization algorithms amenable toGPUacceleration, summarize the growing ecosystem of opensource\u00a0and commercial GPU solvers, and provide benchmarks that quantify current performance.We also present cuOpt, NVIDIA\u2019s<br>open-source library for GPU-accelerated decision optimization. Our goal is to help the optimization community understand where\u00a0GPUs are useful today, where important limitations remain, and where future research and development are needed.<\/p>\n<p><strong>Speakers: Nicolas Blin, Burcin Bozkaya, Akif \u00c7\u00f6rd\u00fck, Chris Maes <\/strong><\/p>    <\/div>\n<\/div>\n<!-- \/module text --><!-- module accordion -->\n<div  class=\"module module-accordion tb_07cp491 \" data-behavior=\"toggle\" data-lazy=\"1\">\n    \n    <ul class=\"ui module-accordion   orange\">\n            <li>\n            <div class=\"accordion-title tf_rel\">\n                <a href=\"#acc-07cp491-0\" class=\"tb_title_accordion\" aria-controls=\"acc-07cp491-0-content\" aria-expanded=\"false\">\n                    <i class=\"accordion-icon\"><svg  class=\"tf_fa tf-ti-plus\" aria-hidden=\"true\"><use href=\"#tf-ti-plus\"><\/use><\/svg><\/i>                                        <span class=\"accordion-title-wrap\">Speaker Bio<\/span>                <\/a>\n            <\/div><!-- .accordion-title -->\n            <div id=\"acc-07cp491-0-content\" data-id=\"acc-07cp491-0\" aria-hidden=\"true\" class=\"accordion-content tf_hide tf_clearfix\">\n                        <div  data-lazy=\"1\" class=\"module_subrow themify_builder_sub_row tf_w col_align_top tb_col_count_1 tb_no69491\">\n                <div  data-lazy=\"1\" class=\"module_column sub_column tb_icsl491 first\">\n                    <!-- module text -->\n<div  class=\"module module-text tb_brfb491   \" data-lazy=\"1\">\n        <div  class=\"tb_text_wrap\">\n        <div class=\"ewa-rteLine\">\n<p><strong>Nicolas Blin<\/strong> is a senior developer technology engineer at NVIDIA. Nicolas holds an M.Sc. in software engineering. He has a background in image processing and GPU-accelerated algorithms. His interests include massively parallel algorithms, performance optimization, and combinatorial and linear optimization.<\/p>\n<p><strong>Burcin Bozkaya <\/strong>is a senior developer relations manager at NVIDIA. He holds a BS and MS in Industrial Engineering and PhD in Management Science, specializing in combinatorial optimization problems and heuristic optimization as applied in transportation and logistics, and supply chain planning. As the developer relations lead for decision optimization, Burcin engages with the OR developer ecosystem to evangelize and support the open-source community, ISV partners and key business planners for developing accelerated optimization solvers.<\/p>\n<p><strong>Akif Coerduek<\/strong> is a senior developer technology engineer at NVIDIA. Akif holds a bachelor\u2019s degree in computer engineering and a master\u2019s degree in software engineering. He has a background in massively parallel pricing engines and GPU-accelerated combinatorial optimization. His interests include parallel algorithms, performance optimization, and combinatorial optimization.<\/p>\n<p><strong>Christopher Maes<\/strong>\u00a0is a principal engineer on the NVIDIA cuOpt team. He received his PhD in Computational and Mathematical Engineering from Stanford University in 2010. His background and research interests are in linear, quadratic, and mixed-integer programming, as well as trajectory optimization, and machine learning.<br>&#8220;<\/p>\n<\/div>    <\/div>\n<\/div>\n<!-- \/module text -->        <\/div>\n                    <\/div>\n                    <\/div><!-- .accordion-content -->\n        <\/li>\n        <\/ul>\n\n<\/div><!-- \/module accordion -->        <\/div>\n                    <div  data-lazy=\"1\" class=\"module_column tb-column col4-1 tb_ibkw472 last\">\n                            <\/div>\n                        <\/div>\n        <\/div>\n        <\/div>\n<!--\/themify_builder_content-->","protected":false},"excerpt":{"rendered":"<p>TutORials<\/p>\n","protected":false},"author":46,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"content-type":"","footnotes":""},"class_list":["post-12076","page","type-page","status-publish","hentry","has-post-title","has-post-date","has-post-category","has-post-tag","has-post-comment","has-post-author",""],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v26.0 (Yoast SEO v26.0) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>TutORials &#187; 2026 INFORMS Annual Meeting<\/title>\n<meta name=\"description\" content=\"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"TutORials\" \/>\n<meta property=\"og:description\" content=\"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/\" \/>\n<meta property=\"og:site_name\" content=\"2026 INFORMS Annual Meeting\" \/>\n<meta property=\"article:modified_time\" content=\"2026-07-20T15:41:31+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/2026_INFORMS_Annual_Meeting_Logo.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"300\" \/>\n\t<meta property=\"og:image:height\" content=\"300\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"72 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/\",\"url\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/\",\"name\":\"TutORials &#187; 2026 INFORMS Annual Meeting\",\"isPartOf\":{\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#website\"},\"datePublished\":\"2026-07-20T15:17:13+00:00\",\"dateModified\":\"2026-07-20T15:41:31+00:00\",\"description\":\"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.\",\"breadcrumb\":{\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"TutORials\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#website\",\"url\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/\",\"name\":\"2026 INFORMS Annual Meeting\",\"description\":\"November 1-4, 2026 | San Francisco, CA\",\"publisher\":{\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#organization\",\"name\":\"2026 INFORMS Annual Meeting\",\"url\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/cropped-2026_INFORMS_Annual_Meeting_Logo.png\",\"contentUrl\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/cropped-2026_INFORMS_Annual_Meeting_Logo.png\",\"width\":512,\"height\":512,\"caption\":\"2026 INFORMS Annual Meeting\"},\"image\":{\"@id\":\"https:\/\/meetings.informs.org\/wordpress\/annual\/#\/schema\/logo\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"TutORials &#187; 2026 INFORMS Annual Meeting","description":"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/","og_locale":"en_US","og_type":"article","og_title":"TutORials","og_description":"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.","og_url":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/","og_site_name":"2026 INFORMS Annual Meeting","article_modified_time":"2026-07-20T15:41:31+00:00","og_image":[{"width":300,"height":300,"url":"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/2026_INFORMS_Annual_Meeting_Logo.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"72 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/","url":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/","name":"TutORials &#187; 2026 INFORMS Annual Meeting","isPartOf":{"@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#website"},"datePublished":"2026-07-20T15:17:13+00:00","dateModified":"2026-07-20T15:41:31+00:00","description":"The TutORials in Operations Research series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science.","breadcrumb":{"@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/tutorials\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/meetings.informs.org\/wordpress\/annual\/"},{"@type":"ListItem","position":2,"name":"TutORials"}]},{"@type":"WebSite","@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#website","url":"https:\/\/meetings.informs.org\/wordpress\/annual\/","name":"2026 INFORMS Annual Meeting","description":"November 1-4, 2026 | San Francisco, CA","publisher":{"@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/meetings.informs.org\/wordpress\/annual\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#organization","name":"2026 INFORMS Annual Meeting","url":"https:\/\/meetings.informs.org\/wordpress\/annual\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#\/schema\/logo\/image\/","url":"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/cropped-2026_INFORMS_Annual_Meeting_Logo.png","contentUrl":"https:\/\/meetings.informs.org\/wordpress\/annual\/files\/2025\/10\/cropped-2026_INFORMS_Annual_Meeting_Logo.png","width":512,"height":512,"caption":"2026 INFORMS Annual Meeting"},"image":{"@id":"https:\/\/meetings.informs.org\/wordpress\/annual\/#\/schema\/logo\/image\/"}}]}},"builder_content":"<h1>TutORials<\/h1>\n<p>The <em>TutORials in Operations Research<\/em> series is published annually by INFORMS as an introduction to emerging and classical subfields of operations research and management science. These chapters are designed to be accessible for all constituents of the INFORMS community, including current students, practitioners, faculty, and researchers. The publication allows readers to keep pace with new developments in the field and serves as augmenting material for a selection of the tutorial presentations offered at the INFORMS Annual Meeting.<\/p>\n<h3>Generative Models for Decision-Making under Distributional Shift<\/h3> Many data-driven decision problems are formulated using a nominal distribution<br>estimated from historical data, while performance is ultimately determined by<br>a deployment distribution that may be shifted, context-dependent, partially observed,<br>or stress-induced. This tutorial presents modern generative models, particularly flowand<br>score-based methods, as mathematical tools for constructing decision-relevant<br>distributions. From an operations research perspective, their primary value lies not<br>in unconstrained sample synthesis but in representing and transforming distributions<br>through transport maps, velocity fields, score fields, and guided stochastic dynamics.<br>We present a unified framework based on pushforward maps, continuity, Fokker\u2013<br>Planck equations,Wasserstein geometry, and optimization in probability space.Within<br>this framework, generative models can be used to learn nominal uncertainty, construct<br>stressed or least-favorable distributions for robustness, and produce conditional or<br>posterior distributions under side information and partial observation. We also highlight<br>representative theoretical guarantees, including forward\u2013reverse convergence for<br>iterative flow models, first-order minimax analysis in transport-map space, and errortransfer<br>bounds for posterior sampling with generative priors. The tutorial provides<br>a principled introduction to using generative models for scenario generation, robust<br>decision-making, uncertainty quantification, and related problems under distributional<br>shift. \u00a0 <p><strong>Speakers: Xiuyuan Cheng, Yunqin Zhu, Yao Xie <\/strong><\/p>\n<ul><li><h4>Speaker Bios<\/h4><p>Xiuyuan Cheng is a professor of mathematics at Duke University. She received her Ph.D. degree from Princeton University in 2013. Before joining Duke, she was a postdoctoral researcher at \u00c9cole Normale Sup\u00e9rieure in Paris from 2013 to 2015 and a Gibbs Assistant Professor at Yale University from 2015 to 2017.\u00a0Her research interests include theoretical and computational techniques for high-dimensional data\u00a0analysis, signal processing, and machine learning. She is a recipient of a Sloan Fellowship and an\u00a0NSF CAREER Award.<\/p> <p><br><strong>Yunqin \u201cVinci\u201d Zhu<\/strong> is a Ph.D. student in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology. He received his B.Eng. degree in artificial intelligence from the University of Science and Technology (USTC) of China. His research interests include machine learning, generative modeling, and optimization. He is a recipient of the Guo Moruo Scholarship from USTC.<\/p> <p><strong>Yao Xie<\/strong>\u00a0 is the Coca-Cola\u00a0Foundation Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology, where she is also Associate Director of the Machine Learning Center. She received her Ph.D. degree in electrical engineering, with a minor in mathematics, from Stanford University and was previously a Research Scientist at Duke University.\u00a0Her research lies at the intersection of statistics, machine learning, and optimization, with a focus\u00a0on developing statistically powerful and computationally efficient methods for high-dimensional,\u00a0sequential, and spatio-temporal data. She is a Member of Cohort 2026 of the National Academies\u2019\u00a0New Voices in Sciences, Engineering, and Medicine program and the IEEE Information Theory<br>Society Distinguished Lecturer for 2026\u20132027. Her honors include the NSF CAREER Award,<br>INFORMS Wagner Prize Finalist, INFORMS Gaver Early Career Award, and C.W.S. Woodroofe<br>Award. She serves as an associate editor for several journals, including IEEE Transactions on<br>Information Theory, Journal of the American Statistical Association\u2014Theory and Methods, Operations\u00a0Research, Annals of Applied Statistics, Sequential Analysis, and INFORMS Journal on Data\u00a0Science.<\/p><\/li><\/ul>\n<p>Xiuyuan Cheng is a professor of mathematics at Duke University. She received her Ph.D. degree from Princeton University in 2013. Before joining Duke, she was a postdoctoral researcher at \u00c9cole Normale Sup\u00e9rieure in Paris from 2013 to 2015 and a Gibbs Assistant Professor at Yale University from 2015 to 2017.\u00a0Her research interests include theoretical and computational techniques for high-dimensional data\u00a0analysis, signal processing, and machine learning. She is a recipient of a Sloan Fellowship and an\u00a0NSF CAREER Award.<\/p> <p><br><strong>Yunqin \u201cVinci\u201d Zhu<\/strong> is a Ph.D. student in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology. He received his B.Eng. degree in artificial intelligence from the University of Science and Technology (USTC) of China. His research interests include machine learning, generative modeling, and optimization. He is a recipient of the Guo Moruo Scholarship from USTC.<\/p> <p><strong>Yao Xie<\/strong>\u00a0 is the Coca-Cola\u00a0Foundation Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering at the Georgia Institute of Technology, where she is also Associate Director of the Machine Learning Center. She received her Ph.D. degree in electrical engineering, with a minor in mathematics, from Stanford University and was previously a Research Scientist at Duke University.\u00a0Her research lies at the intersection of statistics, machine learning, and optimization, with a focus\u00a0on developing statistically powerful and computationally efficient methods for high-dimensional,\u00a0sequential, and spatio-temporal data. She is a Member of Cohort 2026 of the National Academies\u2019\u00a0New Voices in Sciences, Engineering, and Medicine program and the IEEE Information Theory<br>Society Distinguished Lecturer for 2026\u20132027. Her honors include the NSF CAREER Award,<br>INFORMS Wagner Prize Finalist, INFORMS Gaver Early Career Award, and C.W.S. Woodroofe<br>Award. She serves as an associate editor for several journals, including IEEE Transactions on<br>Information Theory, Journal of the American Statistical Association\u2014Theory and Methods, Operations\u00a0Research, Annals of Applied Statistics, Sequential Analysis, and INFORMS Journal on Data\u00a0Science.<\/p>\n<h3>Transform Method for Stochastic Processing and Matching Networks<\/h3> Modern service systems\u2014ranging from cloud data centers and ride-hailing platforms to healthcare facilities\u2014operate at massive scales where congestion is a critical challenge. Utilizing an operations research approach, these systems are analyzed by modeling them as complex stochastic processes, which are typically understood through process-level convergence to fluid and diffusion limits. However, these methods often prove technically dense and provide limited guidance for finite, practical system scales. The transform method, presented in this tutorial, was recently developed as a unified and tractable framework for the steady-state analysis of Stochastic Processing and Matching Networks (SPNs\/SMNs). The transform method overcomes the technical hurdles of process-level convergence by working directly with the pre-limit system. By exploiting the zero-drift property of exponential test functions, the method derives explicit functional equations (acting as a proxy for global balance equations) for the transforms (such as moment-generating functions) of queue-length distributions. This approach provides sharp, non-asymptotic performance guarantees, bridging the gap between theoretical asymptotics and real-world system behavior. Since its introduction in 2020 for load-balancing in data center networks, the transform method has been extended to handle realistic complexities, including customer abandonment, state-dependent arrivals, Markov-modulated arrivals, large-system scale, and multi-dimensional networks with multiple bottlenecks. We survey these theoretical advances and demonstrate their practical relevance across diverse domains, such as matching markets and networked service systems. The transform method provides interpretable bounds tied directly to system parameters, offering a powerful analytical alternative to simulation-heavy or purely asymptotic approaches for system design and control. \u00a0 <p><strong>Speakers: Sushil\u202fVarma, Prakirt Jhunjhunwala, Daniela Hurtado-Lange, Siva Theja Maguluri <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><strong>Sushil Mahavir Varma<\/strong> is an assistant professor in the Industrial and Operations Engineering Department at the University of Michigan, Ann Arbor. Before joining Michigan, he was a postdoctoral researcher at INRIA Paris. He received his PhD degree in operations research from Georgia Institute of Technology. His research lies broadly in applied probability. He has worked on problems spanning two-sided matching markets, electric vehicle operations, queueing theory, load balancing, and graph alignment. His work has been recognized with the 2024 ACM SIGMETRICS Doctoral Dissertation Award, the 2025 Georgia Tech Sigma Xi Best PhD Thesis Award, and finalist recognition for the 2025 INFORMS TSL Dissertation Award. \u00a0 <strong>Siva Theja Magulur<\/strong>i is Fouts Family Early Career Professor and Associate Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. He received his B.Tech in Electrical Engineering from IIT Madras, M.S in ECE, M.S. in Applied Math and a PhD in ECE all from University of Illinois at Urbana Champaign. His research interests span the areas of Networks, Control, Optimization, Algorithms, Applied Probability and Reinforcement Learning. He is a recipient of the biennial \u201cBest Publication in Applied Probability\u201d award, NSF CAREER award, \u201cCTL\/BP Junior Faculty Teaching Excellence Award,\u201d and \u201cStudent Recognition of Excellence in Teaching: Class of 1934 CIOS Award.\u201d \u00a0 <strong>Prakirt Jhunjhunwala<\/strong> is a Postdoctoral Scientist at Amazon in the FBA Science team. Previously, he was a Postdoctoral Research Scholar at Columbia Business School, New York. He received his Ph.D. in Operations Research and a Masters in Mathematics from Georgia Tech in 2023 and his B.Tech. (Honors) in Electrical Engineering from IIT Bombay. His research focuses on the design and analysis of stochastic networks, with applications in data centers and quantum networks. Prakirt received an Honorable Mention for the SIGMETRICS Doctoral Dissertation Award (2023), the Best Paper Award at SPCOM (2018), and the Ed Iacobucci Fellowship for Excellence in Applied Probability and Simulation (2022). \u00a0 <strong>Daniela Hurtado-Lange<\/strong> is an assistant professor in the Operations Department at the Kellogg School of Management at Northwestern University. Before joining Kellogg, she was an assistant professor of Mathematics at William &amp; Mary for 1.5 years. She obtained her Ph.D. in Operations Research from Georgia Tech in December 2021, and her research focuses on performance analysis of stochastic processing networks. Specifically, she works on heavy-traffic analysis and queueing theory. Her work has been recognized with the 2022 Sigma Xi Best Ph.D. Thesis Award, and second place in the 2020 JFIG competition.<\/li><\/ul>\n<strong>Sushil Mahavir Varma<\/strong> is an assistant professor in the Industrial and Operations Engineering Department at the University of Michigan, Ann Arbor. Before joining Michigan, he was a postdoctoral researcher at INRIA Paris. He received his PhD degree in operations research from Georgia Institute of Technology. His research lies broadly in applied probability. He has worked on problems spanning two-sided matching markets, electric vehicle operations, queueing theory, load balancing, and graph alignment. His work has been recognized with the 2024 ACM SIGMETRICS Doctoral Dissertation Award, the 2025 Georgia Tech Sigma Xi Best PhD Thesis Award, and finalist recognition for the 2025 INFORMS TSL Dissertation Award. \u00a0 <strong>Siva Theja Magulur<\/strong>i is Fouts Family Early Career Professor and Associate Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. He received his B.Tech in Electrical Engineering from IIT Madras, M.S in ECE, M.S. in Applied Math and a PhD in ECE all from University of Illinois at Urbana Champaign. His research interests span the areas of Networks, Control, Optimization, Algorithms, Applied Probability and Reinforcement Learning. He is a recipient of the biennial \u201cBest Publication in Applied Probability\u201d award, NSF CAREER award, \u201cCTL\/BP Junior Faculty Teaching Excellence Award,\u201d and \u201cStudent Recognition of Excellence in Teaching: Class of 1934 CIOS Award.\u201d \u00a0 <strong>Prakirt Jhunjhunwala<\/strong> is a Postdoctoral Scientist at Amazon in the FBA Science team. Previously, he was a Postdoctoral Research Scholar at Columbia Business School, New York. He received his Ph.D. in Operations Research and a Masters in Mathematics from Georgia Tech in 2023 and his B.Tech. (Honors) in Electrical Engineering from IIT Bombay. His research focuses on the design and analysis of stochastic networks, with applications in data centers and quantum networks. Prakirt received an Honorable Mention for the SIGMETRICS Doctoral Dissertation Award (2023), the Best Paper Award at SPCOM (2018), and the Ed Iacobucci Fellowship for Excellence in Applied Probability and Simulation (2022). \u00a0 <strong>Daniela Hurtado-Lange<\/strong> is an assistant professor in the Operations Department at the Kellogg School of Management at Northwestern University. Before joining Kellogg, she was an assistant professor of Mathematics at William &amp; Mary for 1.5 years. She obtained her Ph.D. in Operations Research from Georgia Tech in December 2021, and her research focuses on performance analysis of stochastic processing networks. Specifically, she works on heavy-traffic analysis and queueing theory. Her work has been recognized with the 2022 Sigma Xi Best Ph.D. Thesis Award, and second place in the 2020 JFIG competition.\n<h3>Multi-objective Combinatorial Optimization: Foundations, Theory, and Methods<\/h3> <p>This tutorial presents the foundations, theory and methods of multiobjective<br>integer programming, with a particular focus on multi-objective combinatorial<br>optimization (MOCO). Many real-world optimization problems are inherently<br>combinatorial in nature and involve multiple, often conflicting, objectives. MOCO has<br>been widely used to model these complex decision problems across various domains<br>such as transportation, logistics, finance, energy, and healthcare. While the feasible<br>set is typically finite in MOCO problems, these solutions are not always explicitly<br>available to the decision-makers. Adding to this complexity, there is rarely a single<br>solution that optimizes all objectives simultaneously in multi-objective optimization<br>problems. This tutorial provides a structured framework for students, researchers, and<br>practitioners to approach and solve these complex decision problems. We first define<br>key terminology, describe the main characteristics of MOCO problems and discuss<br>their scalarization. We then explore the advanced methods and exact algorithms to<br>generate all nondominated points, for which an improvement in one objective cannot<br>be made without sacrificing performance in another. Since these algorithms become<br>intractable in real-world problem settings with the increase in the number of nondominated<br>points, we also discuss the methods that generate a representative set of<br>solutions with a prespecified level of quality or find preferred solutions. The tutorial<br>provides a broad and accessible overview of existing methods, supported by illustrative<br>examples, discussions, figures, and comprehensive references that clarify their<br>main ideas, strengths, and limitations.<\/p> <p><strong>Speaker: Banu Lokman <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4>\u00a0 <strong>Banu Lokman<\/strong> is a Professor of Operational Research in the School of Organisations, Systems and People at the University of Portsmouth, United Kingdom. She completed her PhD in Industrial Engineering at Middle East Technical University (METU) in Turkey and held academic and research positions at METU and the Aalto University School of Business in Finland. She currently serves as the President of the INFORMS Section on Multiple Criteria Decision Making (MCDM), having previously held board positions in the International Society on MCDM and\u00a0the INFORMS MCDM Section. She is an Associate Editor for Omega and the IMA Journal of\u00a0Management Mathematics and is an editorial board member of the Journal of Multi-Criteria\u00a0Decision Analysis. She is also a member of the Research Committee of the UK Operational\u00a0Research Society and leads UK-based MCDM courses at NATCOR. In 2022, she received the\u00a0Bernard Roy Award from the Association of European Operational Research Societies (EURO)\u00a0Working Group on Multiple Criteria Decision Aiding for her contributions to the field. Her research\u00a0interests include MCDM, combinatorial optimization, multi-objective integer and mixedinteger\u00a0programming, clustering, and applications in energy, sustainability, and healthcare. Her\u00a0work has been published in several peer-reviewed journals, including Management Science and\u00a0European Journal of Operational Research.<\/li><\/ul>\n\u00a0 <strong>Banu Lokman<\/strong> is a Professor of Operational Research in the School of Organisations, Systems and People at the University of Portsmouth, United Kingdom. She completed her PhD in Industrial Engineering at Middle East Technical University (METU) in Turkey and held academic and research positions at METU and the Aalto University School of Business in Finland. She currently serves as the President of the INFORMS Section on Multiple Criteria Decision Making (MCDM), having previously held board positions in the International Society on MCDM and\u00a0the INFORMS MCDM Section. She is an Associate Editor for Omega and the IMA Journal of\u00a0Management Mathematics and is an editorial board member of the Journal of Multi-Criteria\u00a0Decision Analysis. She is also a member of the Research Committee of the UK Operational\u00a0Research Society and leads UK-based MCDM courses at NATCOR. In 2022, she received the\u00a0Bernard Roy Award from the Association of European Operational Research Societies (EURO)\u00a0Working Group on Multiple Criteria Decision Aiding for her contributions to the field. Her research\u00a0interests include MCDM, combinatorial optimization, multi-objective integer and mixedinteger\u00a0programming, clustering, and applications in energy, sustainability, and healthcare. Her\u00a0work has been published in several peer-reviewed journals, including Management Science and\u00a0European Journal of Operational Research.\n<h3>A Modern Treatment of the Primal\u2013Dual Framework for Online Resource Allocation<\/h3> <p>Linear-programming (LP)-based primal\u2013dual methods are fundamental for designing and analyzing algorithms in adversarial (prior-free) online resource allocation. This chapter provides a tutorial on two modern primal-dual frameworks, emphasizing recent developments and contemporary models in operations research. Part I develops an LP-based convex-programming framework where solving a regularized convex program at each arrival captures the tradeoff between greediness and hedging, yielding a dual certificate via Karush\u2013Kuhn\u2013Tucker (KKT) conditions. Because standard LP relaxations can be weak or intractable for stochastic outcomes, Part II introduces a complementary LP-free framework that provides a universal certificate system for evaluating competitive ratios under such uncertainty. Covering a wide array of models\u2014including online vertex-weighted bipartite matching, edge-weighted online matching with free disposal, online matching with stochastic rewards, reusable resources, two-sided assortment optimization, configuration allocation (whole-page optimization), AdWords, and costly cancellations\u2014the tutorial equips readers with versatile proof templates to analyze existing algorithms and develop new solutions for emerging applications.<\/p> <p><strong>Speakers: Rad Niazadeh, Rajan Udwani<\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><strong>Rad Niazadeh<\/strong> is an Associate Professor of Operations Management at the University of Chicago Booth School of Business. He is also part of the faculty at Toyota Technological Institute of Chicago (TTIC) by a courtesy appointment, and a faculty advisor at Lyft Inc. (Fulfillment &amp; Matching Science). Prior to joining Chicago Booth, he was a visiting researcher at Google Research NYC and a Motwani postdoctoral fellow at Stanford University, Computer Science Department. He obtained his PhD in Computer Science (minored in Applied Mathematics) from Cornell University. His research spans online algorithms, online learning, and mechanism design, with applications in theory and practice of online platforms and non-profit operations. His work has received multiple recognitions including the INFORMS Auctions and Market Design Rothkopf Junior Researcher Paper Award (2021, 2024: first place; 2023: second place), the INFORMS Revenue Management and Pricing Dissertation Award (honorable mention), and best student paper awards at INFORMS George Nicholson Competition (2025: honorable mention), INFORMS MSOM (2024), INFORMS Service Science (2025: finalist), INFORMS Data Mining, and IJCAI conference. \u00a0 <strong>Rajan Udwani<\/strong> is an Assistant Professor of Industrial Engineering and Operations Research at the University of California, Berkeley. His research focuses on algorithms for optimization under uncertainty, with a particular emphasis on revenue management and pricing. Before joining UC Berkeley, he was a postdoctoral researcher at Columbia University. He holds a Ph.D. in Operations Research from MIT and a B.Tech. in Electrical Engineering from IIT Bombay. His work has been recognized with INFORMS junior faculty and student paper awards, and is supported by an NSF CAREER Award and the Google Research Scholar Program.<\/li><\/ul>\n<strong>Rad Niazadeh<\/strong> is an Associate Professor of Operations Management at the University of Chicago Booth School of Business. He is also part of the faculty at Toyota Technological Institute of Chicago (TTIC) by a courtesy appointment, and a faculty advisor at Lyft Inc. (Fulfillment &amp; Matching Science). Prior to joining Chicago Booth, he was a visiting researcher at Google Research NYC and a Motwani postdoctoral fellow at Stanford University, Computer Science Department. He obtained his PhD in Computer Science (minored in Applied Mathematics) from Cornell University. His research spans online algorithms, online learning, and mechanism design, with applications in theory and practice of online platforms and non-profit operations. His work has received multiple recognitions including the INFORMS Auctions and Market Design Rothkopf Junior Researcher Paper Award (2021, 2024: first place; 2023: second place), the INFORMS Revenue Management and Pricing Dissertation Award (honorable mention), and best student paper awards at INFORMS George Nicholson Competition (2025: honorable mention), INFORMS MSOM (2024), INFORMS Service Science (2025: finalist), INFORMS Data Mining, and IJCAI conference. \u00a0 <strong>Rajan Udwani<\/strong> is an Assistant Professor of Industrial Engineering and Operations Research at the University of California, Berkeley. His research focuses on algorithms for optimization under uncertainty, with a particular emphasis on revenue management and pricing. Before joining UC Berkeley, he was a postdoctoral researcher at Columbia University. He holds a Ph.D. in Operations Research from MIT and a B.Tech. in Electrical Engineering from IIT Bombay. His work has been recognized with INFORMS junior faculty and student paper awards, and is supported by an NSF CAREER Award and the Google Research Scholar Program.\n<h3>Self-Adapting Approximations of Markov Decision Processes: A Guided Tour<\/h3> <p>Sequential decision making under uncertainty arises across business, engineering, and science. Markov Decision Processes (MDPs) offer a rich modeling language, but translating models into implementable policies requires confronting challenging state and action spaces and non-convex optimization landscapes. Approximations are essential, and making them accessible and performant without algorithmic expertise allows users to focus on formulating MDPs that capture real-world features rather than\u00a0simplifying their models to facilitate solution. Obtaining a policy involves a three-stage COR cycle: Constructing a parametrized model that approximates the MDP, Optimizing for the parameters of this model, and Refining the model by learning from the<br>solution. These stages involve design choices that burden the user, leading them to simplify or skip stages.<\/p> <p>This tutorial provides an overview of methods that reduce the user burden using COR as its guide. Construction ranges from lightweight extensible models to automated structural reformulations. Optimization leverages mathematical programming and firstorder methods that have matured in theory and off-the-shelf software. Refinement performs feature expansion and approximation tightening, feeding back into the construct stage. When a combination of techniques across COR stages results in both accessibility and performance, we refer to it as a self-adapting approximation. Such an approximation adapts to problem structure, instance data, or solution progress. We guide readers through these ideas across weakly coupled MDPs and general continuous state-action MDPs, providing generalizable foundations and a code base to get started on a simple example. The tutorial concludes by outlining the potential for foundation models and quantum computing to further impact this area.<\/p> <p><strong>Speakers: Andre Augusto Cire, Selvaprabu Nadarajah, Parshan Pakiman, Negar Soheili <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong>Andre A. Cire<\/strong> is an Associate Professor of Operations Management and Analytics at the University of Toronto, cross-appointed between the Rotman School of Management and the Department of Management at the Scarborough campus. His research bridges methodological development and practical applications in optimization, with a focus on sequential decision-making, mathematical programming, dynamic programming, network models, and applications in scheduling, healthcare, and supply chains. Andre earned his PhD in Operations Research from Carnegie Mellon University, and his contributions have been recognized with awards such as the INFORMS Harvey J. Greenberg Award (2024), an honorable mention for the INFORMS Computing Society Prize (2023), and research and teaching awards at the University of Toronto. He has also held senior editorial and service roles for multiple journals and conferences including INFORMS Journal on Computing, AAAI, and NeurIPS.<\/p> <p><strong>Selvaprabu (Selva) Nadarajah<\/strong> is an Associate Professor of Information and Decision Sciences and Bielinski Family Endowed Scholar at the College of Business Administration, University of Illinois Chicago (UIC). He is also a UIC Global Scholar and previously served as the Decision Intelligence R&amp;D Lead at the Discovery Partners Institute, the innovation hub of the University of Illinois System. He is an Associate Editor for Decision Sciences, Operations Research, and Production and Operations Management. His research develops self-adapting approximation methods for large-scale Markov decision processes. He applies these methods to energy investment and operations problems, including real options valuation of commodity and energy assets, renewable energy procurement, and capacity expansion. This work has been recognized with awards from INFORMS, the Commodity and Energy Markets Association, and NeurIPS. It has been funded by the Alfred P. Sloan Foundation, Argonne National Laboratory, and industry. He has received the UIC College of Business Teaching Excellence Award and the EnergyTech University Prize Faculty Explorer Award from the U.S. Department of Energy for educational initiatives. He holds a PhD in Operations Research from the Tepper School of Business at Carnegie Mellon University.<\/p> <p><strong>Parshan Pakiman<\/strong> is an Assistant Professor in the Department of Operations Management and Strategy at the University at Buffalo School of Management. His research focuses on approximate dynamic programming and data-driven optimization methods for sequential decision making, with an emphasis on large-scale Markov decision processes and structured relaxations. His work develops algorithms with strong theoretical guarantees that minimize the need for human intervention during deployment, including model selection and parameter tuning. These methods are designed to be scalable, interpretable, and accessible to practitioners, with applications in healthcare operations and revenue management. Prior to joining the University at Buffalo, he was a Principal Researcher at the Tolan Center for Healthcare at the University of Chicago Booth School of Business. He received his PhD in Information and Decision Sciences from the University of Illinois Chicago and his BSc in Applied Mathematics from the University of Tehran.<\/p> <p><strong>Negar Soheili<\/strong> is an Associate Professor in the Department of Information and Decision Sciences at the University of Illinois Chicago. She received her PhD in Operations Research from Carnegie Mellon University. Her research develops scalable optimization algorithms for machine learning and sequential decision-making under uncertainty. In particular, she designs efficient first-order methods for large-scale constrained optimization and the approximation of Markov decision processes, with applications in healthcare, supply chains, and business analytics. She launched the PhD program in Operations Research and Business Analytics at UIC. She serves as an Associate Editor for the INFORMS Journal on Computing and for Optimization Letters.<\/p> <p>\"<\/p><\/li><\/ul>\n<p><strong>Andre A. Cire<\/strong> is an Associate Professor of Operations Management and Analytics at the University of Toronto, cross-appointed between the Rotman School of Management and the Department of Management at the Scarborough campus. His research bridges methodological development and practical applications in optimization, with a focus on sequential decision-making, mathematical programming, dynamic programming, network models, and applications in scheduling, healthcare, and supply chains. Andre earned his PhD in Operations Research from Carnegie Mellon University, and his contributions have been recognized with awards such as the INFORMS Harvey J. Greenberg Award (2024), an honorable mention for the INFORMS Computing Society Prize (2023), and research and teaching awards at the University of Toronto. He has also held senior editorial and service roles for multiple journals and conferences including INFORMS Journal on Computing, AAAI, and NeurIPS.<\/p> <p><strong>Selvaprabu (Selva) Nadarajah<\/strong> is an Associate Professor of Information and Decision Sciences and Bielinski Family Endowed Scholar at the College of Business Administration, University of Illinois Chicago (UIC). He is also a UIC Global Scholar and previously served as the Decision Intelligence R&amp;D Lead at the Discovery Partners Institute, the innovation hub of the University of Illinois System. He is an Associate Editor for Decision Sciences, Operations Research, and Production and Operations Management. His research develops self-adapting approximation methods for large-scale Markov decision processes. He applies these methods to energy investment and operations problems, including real options valuation of commodity and energy assets, renewable energy procurement, and capacity expansion. This work has been recognized with awards from INFORMS, the Commodity and Energy Markets Association, and NeurIPS. It has been funded by the Alfred P. Sloan Foundation, Argonne National Laboratory, and industry. He has received the UIC College of Business Teaching Excellence Award and the EnergyTech University Prize Faculty Explorer Award from the U.S. Department of Energy for educational initiatives. He holds a PhD in Operations Research from the Tepper School of Business at Carnegie Mellon University.<\/p> <p><strong>Parshan Pakiman<\/strong> is an Assistant Professor in the Department of Operations Management and Strategy at the University at Buffalo School of Management. His research focuses on approximate dynamic programming and data-driven optimization methods for sequential decision making, with an emphasis on large-scale Markov decision processes and structured relaxations. His work develops algorithms with strong theoretical guarantees that minimize the need for human intervention during deployment, including model selection and parameter tuning. These methods are designed to be scalable, interpretable, and accessible to practitioners, with applications in healthcare operations and revenue management. Prior to joining the University at Buffalo, he was a Principal Researcher at the Tolan Center for Healthcare at the University of Chicago Booth School of Business. He received his PhD in Information and Decision Sciences from the University of Illinois Chicago and his BSc in Applied Mathematics from the University of Tehran.<\/p> <p><strong>Negar Soheili<\/strong> is an Associate Professor in the Department of Information and Decision Sciences at the University of Illinois Chicago. She received her PhD in Operations Research from Carnegie Mellon University. Her research develops scalable optimization algorithms for machine learning and sequential decision-making under uncertainty. In particular, she designs efficient first-order methods for large-scale constrained optimization and the approximation of Markov decision processes, with applications in healthcare, supply chains, and business analytics. She launched the PhD program in Operations Research and Business Analytics at UIC. She serves as an Associate Editor for the INFORMS Journal on Computing and for Optimization Letters.<\/p> <p>\"<\/p>\n<h3>A Tutorial on Reinforcement Learning for LLMs: RLHF and Beyond<\/h3> <p>coming soon<\/p> <p><strong>Speaker: Daniel Jiang<\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong><b>Miguel F. Anjos <\/b><\/strong>holds the Chair of Operational Research at the School of Mathematics, University of Edinburgh, U.K. He previously held faculty positions at Polytechnique Montreal, the University of Waterloo, and the University of Southampton. He is the Founding Academic Director of the Trottier Institute for Energy at Polytechnique Montreal. His accolades include an Inria International Chair, a Canada Research Chair, the NSERC-Hydro-Quebec-Schneider Electric Industrial Research Chair, a Humboldt Research Fellowship, INFORMS and IEEE Senior Memberships, and the Queen Elizabeth II Diamond Jubilee Medal. He is a Fellow of EUROPT and of the Canadian Academy of Engineering. Professor Anjos carries out research in mathematical optimization and its industrial applications. He has published four books and more than 100 scientific journal articles, and has led research collaborations with companies such as EDF, Hydro-Quebec, National Grid ESO (now NESO), Rio Tinto, and Schneider Electric. He served as Editor-in-Chief of Optimization and Engineering, is currently Area Editor for the Journal of Optimization Theory and Applications and for RAIRO-OR, and is Associate Editor for several other journals. Professor Anjos currently serves as Chair of the Mathematical Optimization Society, INFORMS Vice-President for International Activities, and member of the Managing Boards of the EURO Working Groups on Continuous Optimization and on Stochastic Optimization. He previously served as President of the INFORMS Section on Energy, Natural Resources, and the Environment, on the Council of the Mathematical Optimization Society, as Program Director for the SIAM Activity Group on Optimization, and as Vice-Chair of the INFORMS Optimization Society.<\/p><\/li><\/ul>\n<p><strong><b>Miguel F. Anjos <\/b><\/strong>holds the Chair of Operational Research at the School of Mathematics, University of Edinburgh, U.K. He previously held faculty positions at Polytechnique Montreal, the University of Waterloo, and the University of Southampton. He is the Founding Academic Director of the Trottier Institute for Energy at Polytechnique Montreal. His accolades include an Inria International Chair, a Canada Research Chair, the NSERC-Hydro-Quebec-Schneider Electric Industrial Research Chair, a Humboldt Research Fellowship, INFORMS and IEEE Senior Memberships, and the Queen Elizabeth II Diamond Jubilee Medal. He is a Fellow of EUROPT and of the Canadian Academy of Engineering. Professor Anjos carries out research in mathematical optimization and its industrial applications. He has published four books and more than 100 scientific journal articles, and has led research collaborations with companies such as EDF, Hydro-Quebec, National Grid ESO (now NESO), Rio Tinto, and Schneider Electric. He served as Editor-in-Chief of Optimization and Engineering, is currently Area Editor for the Journal of Optimization Theory and Applications and for RAIRO-OR, and is Associate Editor for several other journals. Professor Anjos currently serves as Chair of the Mathematical Optimization Society, INFORMS Vice-President for International Activities, and member of the Managing Boards of the EURO Working Groups on Continuous Optimization and on Stochastic Optimization. He previously served as President of the INFORMS Section on Energy, Natural Resources, and the Environment, on the Council of the Mathematical Optimization Society, as Program Director for the SIAM Activity Group on Optimization, and as Vice-Chair of the INFORMS Optimization Society.<\/p>\n<h3>Foundations of Reinforcement Learning and Control: Connections and New Perspective<\/h3> <p>coming soon<\/p> <p><strong>Speakers: Claire Vernade, Onno Eberhard Max, Martha White, Florian D\u00f6rfler, Csaba Szepevari, Miroslav Krstic, Michael Muehlebach<\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><strong>Tauhid Zaman<\/strong> is an Associate Professor of Operations Management at the Yale School of Management. He earned his BS, MEng, and PhD in electrical engineering and computer science from MIT. His research focuses on tackling information operations challenges in social media, with topics ranging from combating online extremism and detecting bots, to designing and evaluating effective influence campaigns. His broader interests include generative AI, especially as it relates to social media content creation, as well as algorithmic sports betting. His work has garnered several academic awards, including the Sigmetrics Test of Time Award and multiple INFORMS Social Media Analytics Best Student Paper Awards. His research has been highlighted in major media outlets, such as The Wall Street Journal, Wired, Mashable, Los Angeles Times, Bloomberg, and Time magazine. \u00a0 <strong>Yen-Shao Chen<\/strong> is a Ph.D. candidate in Operations Management at Yale University. His research focuses on social media information operations, with an emphasis on modeling opinion dynamics and optimizing influence campaigns. His dissertation explores how opinions are shaped within online social networks, using mathematical modeling, optimal control theory, and generative AI. Before entering academia, he worked as a Senior Knowledge Analyst at McKinsey &amp; Company across the U.S. and Asia, where he led client capability-building programs and analytics initiatives in supply chain and procurement. He has also held roles in private equity and semiconductor manufacturing. He earned a B.S. in Electrical Engineering from National Taiwan University.<\/li><\/ul>\n<strong>Tauhid Zaman<\/strong> is an Associate Professor of Operations Management at the Yale School of Management. He earned his BS, MEng, and PhD in electrical engineering and computer science from MIT. His research focuses on tackling information operations challenges in social media, with topics ranging from combating online extremism and detecting bots, to designing and evaluating effective influence campaigns. His broader interests include generative AI, especially as it relates to social media content creation, as well as algorithmic sports betting. His work has garnered several academic awards, including the Sigmetrics Test of Time Award and multiple INFORMS Social Media Analytics Best Student Paper Awards. His research has been highlighted in major media outlets, such as The Wall Street Journal, Wired, Mashable, Los Angeles Times, Bloomberg, and Time magazine. \u00a0 <strong>Yen-Shao Chen<\/strong> is a Ph.D. candidate in Operations Management at Yale University. His research focuses on social media information operations, with an emphasis on modeling opinion dynamics and optimizing influence campaigns. His dissertation explores how opinions are shaped within online social networks, using mathematical modeling, optimal control theory, and generative AI. Before entering academia, he worked as a Senior Knowledge Analyst at McKinsey &amp; Company across the U.S. and Asia, where he led client capability-building programs and analytics initiatives in supply chain and procurement. He has also held roles in private equity and semiconductor manufacturing. He earned a B.S. in Electrical Engineering from National Taiwan University.\n<h3>Decision-Focused Learning: When and Why Traditional Prediction Models Fail<\/h3> <p>Plugging predictions of unknown parameters into downstream optimization<br>problems, often referred to as the \u201cpredict-then-optimize\u201d paradigm, has long<br>been a standard approach in decision-making under uncertainty. However, improved<br>predictive accuracy does not, in general, translate into improved decision quality.<br>This disconnect has motivated growing interest in decision-focused learning (DFL)<br>within the operations research community. This tutorial reviews recent developments<br>in DFL and highlights key methodological insights, with a particular focus on stochastic<br>linear programming as the downstream decision-making problem.We discuss why<br>several widely used tools in traditional statistical learning are not directly suited to<br>decision-focused settings and must be rethought, including (i) data collection strategies<br>driven purely by predictive uncertainty and (ii) distributional distance measures<br>such as the Wasserstein distance. We summarize properties of DFL that distinguish it<br>from conventional predictive modeling and provide insights into the development of<br>new decision-focused tools.<\/p> <p><strong>Speaker: Mo Liu<\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong>Mo Liu<\/strong> is an assistant professor in the Department of Statistics and Operations Research at the University of North Carolina at Chapel Hill. He received his PhD in Industrial Engineering and Operations Research from the University of California, Berkeley. His research centers on decision-focused learning, a methodology that designs and trains prediction models while accounting for downstream optimization problems. These downstream problems arise in real-world applications such as revenue and inventory management.<\/p><\/li><\/ul>\n<p><strong>Mo Liu<\/strong> is an assistant professor in the Department of Statistics and Operations Research at the University of North Carolina at Chapel Hill. He received his PhD in Industrial Engineering and Operations Research from the University of California, Berkeley. His research centers on decision-focused learning, a methodology that designs and trains prediction models while accounting for downstream optimization problems. These downstream problems arise in real-world applications such as revenue and inventory management.<\/p>\n<h3>Fraud Analytics as a Sequential Decision System: Integrating Machine Learning, Optimization, and Adversarial Learning<\/h3> Fraud analytics is fundamentally a decision problem under uncertainty,<br>involving trade-offs between detection performance, investigation costs, and operational<br>constraints. While statistical and machine learning models are widely used to<br>detect anomalous behavior and estimate fraud risk, they are often deployed without<br>explicit consideration of downstream decisions, strategic adaptation, and system-level<br>dynamics. This tutorial presents a unified framework that reframes fraud analytics<br>as a sequential decision system involving adaptive and adversarial agents. We review<br>descriptive and predictive models, and embed them within a decision-theoretic framework<br>that captures trade-offs between false positives, false negatives, and resource<br>constraints. We further introduce adversarial risk analysis and related approaches to<br>model strategic interactions between fraudsters and detection systems. By connecting<br>prediction, optimization, and adversarial modeling, the tutorial highlights how decisions<br>influence both operational outcomes and future data through feedback effects.<br>This sequential perspective emphasizes the need for adaptive policies that account<br>for evolving fraud behavior and changing system conditions. Examples from health<br>care and financial fraud illustrate how analytical models support real-world decisionmaking<br>and resource allocation in high-stakes environments. Intended for researchers<br>and practitioners across operations research, statistics, and data science, this tutorial<br>provides an accessible synthesis that requires no prior background. By the end, the<br>reader will understand howto frame fraud detection as a decision problem, evaluate the<br>limitations of purely predictive approaches, and reason about adversarial adaptation<br>within a unified sequential framework applicable across fraud domains. \u00a0 <p><strong>Speaker: Tahir Ekin<\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><strong>Tahir Ekin<\/strong>\u00a0is Fields Chair in Business Analytics and Professor of Analytics at Texas State University, where he also serves as the founding Director of the Center for Analytics and Data Science (TXST CADS). His research focuses on probabilistic modeling, statistical learning, decision-making under uncertainty, adversarial machine learning, and fraud analytics, with applications in health care. He is the author of \"Statistics and Health Care Fraud: How to Save Billions\" (ASA\u2013CRC Press). His work has been supported by the National Science Foundation, Air Force Office of Scientific Research, and Texas Health and Human Services. He holds a Ph.D. in Decision Sciences from The George Washington University.<\/li><\/ul>\n<strong>Tahir Ekin<\/strong>\u00a0is Fields Chair in Business Analytics and Professor of Analytics at Texas State University, where he also serves as the founding Director of the Center for Analytics and Data Science (TXST CADS). His research focuses on probabilistic modeling, statistical learning, decision-making under uncertainty, adversarial machine learning, and fraud analytics, with applications in health care. He is the author of \"Statistics and Health Care Fraud: How to Save Billions\" (ASA\u2013CRC Press). His work has been supported by the National Science Foundation, Air Force Office of Scientific Research, and Texas Health and Human Services. He holds a Ph.D. in Decision Sciences from The George Washington University.\n<h3>Deep Learning for Sequential Decision Making under Uncertainty: Foundations, Frameworks, and Frontiers<\/h3> <p>Artificial intelligence (AI) is moving beyond prediction toward systems<br>supporting decisions in complex, dynamic environments. This shift creates a natural<br>intersection with operations research and management science (OR\/MS), which<br>has long provided methodological foundations for sequential decision making under<br>uncertainty. At the same time, deep learning advances, including feedforward neural<br>networks, recurrent architectures, transformers, large language models (LLMs),<br>and deep reinforcement learning, have expanded data-driven modeling for large-scale<br>decisions. This tutorial presents an OR\/MS-centered perspective on deep learning<br>for sequential decision making under uncertainty, bridging neural architectures and<br>OR\/MS approaches to decision making. Its premise: deep learning complements<br>optimization rather than replacing it. Deep learning brings adaptability and scalable<br>approximation, whereas OR\/MS provides the mathematical rigor to represent constraints,<br>recourse, uncertainty, and decision quality. The tutorial reviews key decision<br>making foundations, connects them to the major neural architectures in modern AI, and<br>organizes the field around three central themes: predict-then-optimize and decisionaware<br>learning, learning-based decision generation under constraints for continuous<br>and discrete problems with temporal coupling, and deep reinforcement learning for<br>sequential and combinatorial decision making. Impact spans supply chains, service<br>systems, healthcare and epidemic response, agriculture, energy, environmental sustainability,<br>and autonomous operations. This tutorial frames these developments as<br>part of a shift from predictive AI toward decision-capable AI, highlighting OR\/MS\u2019s<br>role in shaping the next generation of integrated learning\u2013optimization systems.<\/p> <p><strong>Speaker: Esra B\u00fcy\u00fcktahtak\u0131n Toy <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong>Esra B\u00fcy\u00fcktahtak\u0131n<\/strong>\u00a0is a Full Professor of Operations Research in the Grado Department of Industrial and Systems Engineering at Virginia Tech, where she directs the Systems\u00a0Optimization and Machine Learning Lab (SysOptiMaL). She earned her Ph.D. in Operations\u00a0Research from the University of Florida. Her research advances multi-stage stochastic mixedinteger\u00a0programming through optimization theory, algorithmic innovation, and learning-enhanced\u00a0optimization. She is recognized for pioneering contributions at the interface of deep learning and\u00a0optimization for sequential decision making under uncertainty. Her work bridges operations research,\u00a0machine learning, and artificial intelligence, with applications in health systems, epidemic\u00a0supply chains, biosecurity, defense, ecological conservation, agriculture, forestry, and environmental\u00a0sustainability.<\/p> <p>Dr. B\u00fcy\u00fcktahtak\u0131n is the recipient of the National Science Foundation (NSF) CAREER Award (2016) and the INFORMS Minority Issues Forum (MIF) Early Career Award (2016), and her research\u00a0has been supported by NSF, the U.S. Department of Agriculture (USDA), the Office of Naval Research (ONR), the U.S. Forest Service, the Virginia Department of Forestry, the Minnesota\u00a0Aquatic Invasive Species Research Center (MAISRC), and the 4-VA Collaborative Research\u00a0Program, with more than $3 million in external funding. She has authored 49 peer-reviewed journal\u00a0publications in leading scholarly outlets, including 27 papers in A* and A ranked journals. Her\u00a0work has received six INFORMS Best Publication Awards and has been featured three times in\u00a0ISE Magazine, as well as in the INFORMS Computing Society and U.S. Forest Service newsletters.\u00a0Her professional service includes leadership in the INFORMS community, where she served\u00a0as President of the INFORMS Junior Faculty Interest Group (JFIG, 2014\u20132015) and received two\u00a0INFORMS Service Awards. She currently serves as an Associate Editor of the INFORMS Journal\u00a0on Computing.<\/p><\/li><\/ul>\n<p><strong>Esra B\u00fcy\u00fcktahtak\u0131n<\/strong>\u00a0is a Full Professor of Operations Research in the Grado Department of Industrial and Systems Engineering at Virginia Tech, where she directs the Systems\u00a0Optimization and Machine Learning Lab (SysOptiMaL). She earned her Ph.D. in Operations\u00a0Research from the University of Florida. Her research advances multi-stage stochastic mixedinteger\u00a0programming through optimization theory, algorithmic innovation, and learning-enhanced\u00a0optimization. She is recognized for pioneering contributions at the interface of deep learning and\u00a0optimization for sequential decision making under uncertainty. Her work bridges operations research,\u00a0machine learning, and artificial intelligence, with applications in health systems, epidemic\u00a0supply chains, biosecurity, defense, ecological conservation, agriculture, forestry, and environmental\u00a0sustainability.<\/p> <p>Dr. B\u00fcy\u00fcktahtak\u0131n is the recipient of the National Science Foundation (NSF) CAREER Award (2016) and the INFORMS Minority Issues Forum (MIF) Early Career Award (2016), and her research\u00a0has been supported by NSF, the U.S. Department of Agriculture (USDA), the Office of Naval Research (ONR), the U.S. Forest Service, the Virginia Department of Forestry, the Minnesota\u00a0Aquatic Invasive Species Research Center (MAISRC), and the 4-VA Collaborative Research\u00a0Program, with more than $3 million in external funding. She has authored 49 peer-reviewed journal\u00a0publications in leading scholarly outlets, including 27 papers in A* and A ranked journals. Her\u00a0work has received six INFORMS Best Publication Awards and has been featured three times in\u00a0ISE Magazine, as well as in the INFORMS Computing Society and U.S. Forest Service newsletters.\u00a0Her professional service includes leadership in the INFORMS community, where she served\u00a0as President of the INFORMS Junior Faculty Interest Group (JFIG, 2014\u20132015) and received two\u00a0INFORMS Service Awards. She currently serves as an Associate Editor of the INFORMS Journal\u00a0on Computing.<\/p>\n<h3>Multiagent Online Learning in Dynamic and Uncertain Environments<\/h3> Multiagent online learning studies how multiple decision-making agents adapt their behavior over time in response to strategic interaction, uncertainty, and non-stationary environments created by other adaptive agents. Such settings arise naturally in large-scale engineered and socio-technical systems, including transportation networks, energy markets, financial systems, supply chains, and emerging agentic AI platforms, where agents may be any combination of humans, algorithms, or physical systems. This article presents a tutorial overviewof learning in games and evolutionary game theory as a foundational framework for modeling and analyzing these interactions. We introduce core game-theoretic concepts and discuss how these outcomes may emerge under adaptive learning dynamics, along with selected impossibility results that capture obstacles to these outcomes. Representative discrete-time and continuous-time learning algorithms and their connections are reviewed alongside their convergence and long-run properties. The tutorial further presents learning for stochastic and Markov game settings, drawing connections to multiagent reinforcement learning and illustrating how strategic-form learning results can be leveraged in this generalized setting. \u00a0 <p><strong>Speakers: Ceyhun Eksin, Jeff S. Shamma, Behrouz Touri <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><strong>Ceyhun Eksin <\/strong>is an Associate Professor with the Department of Industrial and Systems Engineering, Texas A&amp;M\u00a0University, College Station, TX, USA. He received the B.Sc. degree in Control Engineering from Istanbul Technical University, Istanbul, Turkey, in 2005, the M.S. degree in Industrial Engineering from Bogazi\u00e7iUniversity, Istanbul, in 2008, the M.A. degree in statistics from the Wharton Statistics Department, and the Ph.D. degree in Electrical and Systems Engineering from University of Pennsylvania, in 2015. He was a Post-Doctoral Researcher jointly affiliated with the School of Biological Sciences and the School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA. He was a recipient of the NSF CAREER Award in 2023. His research interests include networks, game theory, control theory, and distributed optimization. \u00a0 <strong>Jeff Shamma<\/strong> is the Department Head of Industrial and Enterprise Systems Engineering and Jerry S. Dobrovolny Chair at the University of Illinois Urbana-Champaign. He previously held faculty positions at the King Abdullah University of Science and Technology (KAUST) and at Georgia Tech as the Julian T. Hightower Chair in Systems and Controls. Jeff received a PhD in Systems Science and Engineering from MIT in 1988. He is a Fellow of IEEE and IFAC, a past Distinguished Lecturer of the IEEE Control Systems Society, and a recipient of the IFAC High Impact Paper Award, AACC Donald P. Eckman Award, and NSF Young Investigator Award. Jeff has been a plenary\/semi-plenary speaker at NeurIPS, World Congress of the Game Theory Society, and IEEE Conference on Decision and Control. He was Editor-in-Chief of the IEEE Transactions on Control of Network Systems from 2020-2024. Jeff\u2019s research focuses on decision and control, game theory, and multi-agent systems. \u00a0 <strong>Behrouz Touri <\/strong>is an Associate Professor of the Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign (UIUC) and an affiliate faculty of the ECE Departments at UIUC and University of California, San Diego (UCSD). Prior to joining UIUC, he was an Associate Professor of ECE at the UCSD. He received his B.Sc. degree in Electrical Engineering from Isfahan University of Technology, Isfahan, Iran in 2006, his M.Sc. degree in Communications, Systems, Electronics from Jacobs University, Bremen, Germany in 2008, and his Ph.D. degree in Industrial Engineering from University of Illinois at Urbana-Champaign in 2011. His research interests include applied probability theory, distributed optimization, control and estimation, population dynamics, and game theory.<\/li><\/ul>\n<strong>Ceyhun Eksin <\/strong>is an Associate Professor with the Department of Industrial and Systems Engineering, Texas A&amp;M\u00a0University, College Station, TX, USA. He received the B.Sc. degree in Control Engineering from Istanbul Technical University, Istanbul, Turkey, in 2005, the M.S. degree in Industrial Engineering from Bogazi\u00e7iUniversity, Istanbul, in 2008, the M.A. degree in statistics from the Wharton Statistics Department, and the Ph.D. degree in Electrical and Systems Engineering from University of Pennsylvania, in 2015. He was a Post-Doctoral Researcher jointly affiliated with the School of Biological Sciences and the School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA. He was a recipient of the NSF CAREER Award in 2023. His research interests include networks, game theory, control theory, and distributed optimization. \u00a0 <strong>Jeff Shamma<\/strong> is the Department Head of Industrial and Enterprise Systems Engineering and Jerry S. Dobrovolny Chair at the University of Illinois Urbana-Champaign. He previously held faculty positions at the King Abdullah University of Science and Technology (KAUST) and at Georgia Tech as the Julian T. Hightower Chair in Systems and Controls. Jeff received a PhD in Systems Science and Engineering from MIT in 1988. He is a Fellow of IEEE and IFAC, a past Distinguished Lecturer of the IEEE Control Systems Society, and a recipient of the IFAC High Impact Paper Award, AACC Donald P. Eckman Award, and NSF Young Investigator Award. Jeff has been a plenary\/semi-plenary speaker at NeurIPS, World Congress of the Game Theory Society, and IEEE Conference on Decision and Control. He was Editor-in-Chief of the IEEE Transactions on Control of Network Systems from 2020-2024. Jeff\u2019s research focuses on decision and control, game theory, and multi-agent systems. \u00a0 <strong>Behrouz Touri <\/strong>is an Associate Professor of the Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign (UIUC) and an affiliate faculty of the ECE Departments at UIUC and University of California, San Diego (UCSD). Prior to joining UIUC, he was an Associate Professor of ECE at the UCSD. He received his B.Sc. degree in Electrical Engineering from Isfahan University of Technology, Isfahan, Iran in 2006, his M.Sc. degree in Communications, Systems, Electronics from Jacobs University, Bremen, Germany in 2008, and his Ph.D. degree in Industrial Engineering from University of Illinois at Urbana-Champaign in 2011. His research interests include applied probability theory, distributed optimization, control and estimation, population dynamics, and game theory.\n<h3>Parallel Computing for Two-Stage Stochastic Infrastructure Planning<\/h3> <p>Infrastructure planning has become increasingly difficult in recent years as natural hazards affect supply and demand patterns as well as the network of equipment\u00a0connecting the two. In order to plan coordinated infrastructure systems that are resilient to a variety of potential threats, it is necessary to represent these systems at sufficiently\u00a0high resolution to capture geographic and temporal variations as well as uncertainty. Both of these factors translate into much larger optimization problems than have\u00a0traditionally been considered, and solving these problems is at the frontier of what is computationally feasible. Parallel computing is a tool to push that frontier.<br>In this tutorial, we present methods for solving large-scale two-stage stochastic<br>mixed-integer linear programming (MILP) problems using high-performance computing<br>(HPC) resources, with a focus on infrastructure planning problems. To this end,<br>we cover the necessary basics of modeling stochastic infrastructure planning problems<br>and leveraging parallel computing resources to solve stochastic MILPs. We discuss<br>decomposition algorithms and their parallel implementation in the Python package<br>mpi-sppy and present examples of how to use this tool to solve stochastic infrastructure<br>planning problems. Finally, we present an example of how mpi-sppy has<br>been used to solve a realistically sized power system expansion planning problem for<br>California to demonstrate the difficulty of solving large-scale, stochastic, infrastructure<br>planning problems and how HPC resources can be leveraged to solve such problems.<\/p> <p><strong>Speakers: Tom\u00e1s Valencia Zuluaga,\u00a0Elizabeth Glista,\u00a0Amelia Musselman,\u00a0and Jean-Paul Watson <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong>Elizabeth Glista<\/strong>\u00a0is a research scientist at Lawrence Livermore National Laboratory (LLNL). Her research focuses on optimization problems with applications to power system planning, operation, and resilience, including large-scale stochastic planning and non-convex operational problems. At LLNL, she has contributed to internal research projects and to work supported by the U.S. Department of Energy\u2019s Office of Electricity through the Advanced Grid Modeling (AGM) and North American Energy Resilience Model (NAERM) projects. She holds a PhD and an MS in Mechanical Engineering, Controls, from the University of California, Berkeley (2023, 2018) and a BS in Mechanical Engineering from the Massachusetts Institute of Technology (2017). Her work has been recognized with the IEEE Power &amp; Energy Society General Meeting Best Conference Paper Award (2022) and the American Control Conference Best Student Paper Award (2020). Amelia Musselman is an operations research engineer at Lawrence Livermore National Laboratory. She also has experience at Sandia National Laboratories, RAND Corporation, and Pacific Northwest National Laboratory. She holds a Ph.D. in Industrial Engineering and M.S. in Operations Research from Georgia Institute of Technology as well as a B.S. in Mathematics from Harvey Mudd College. Her expertise is in applications of optimization, including multi-objective, stochastic, and robust optimization, to critical infrastructure planning and protection. She has experience working on problems such as stochastic unit commitment, capacity expansion planning, power system and control network restoration, distributed optimization for electric vehicle charging, and other areas of power system planning and protection under uncertainty.<\/p> <p><strong>Tomas Valencia Zuluaga<\/strong>\u00a0is a postdoctoral researcher in the Center for Applied Scientific Computing at Lawrence Livermore National Laboratory (LLNL). His research lies at the intersection of optimization and power systems applications, including planning, operation and electricity markets. At LLNL, he has worked on developing high-performance-computing tools for optimal power grid expansion planning under uncertainty. He obtained his PhD in Industrial Engineering and Operations Research (2024) from UC Berkeley, where he received the IEOR Faculty Fellowship award (2023) and Outstanding Graduate Student Instructor Award (2022). He also holds a MS in Electrical Engineering (2018) and BS in Mechatronics Engineering (2014) from Universidad Nacional de Colombia in Bogot\u00e1, and has professional experience in the Oil &amp; Gas and Power sectors in Colombia.<\/p> <p><strong>Jean-Paul Watson (\"JP\")<\/strong>\u00a0is a Distinguished Member of Technical Staff in the Computational Engineering Division (CED) at Lawrence Livermore National Laboratory (LLNL), in Livermore California. At LLNL, he is the Associate Program Lead for Disaster Resilience in the Global Security Directorate. JP leads a diverse team of researchers focused on developing advanced analytics for critical infrastructure operations, planning, and resilience \u2013 emphasizing decision-making under uncertainty. He is co-inventor of the widely used Pyomo algebraic modeling language for mathematical optimization (www.pyomo.org), and has co-authored over 75 journal articles, 30 conference papers, and 3 books. JP has received the R&amp;D 100 award, the INFORMS Computing Society Prize, and was an INFORMS Edelman finalist.<\/p><\/li><\/ul>\n<p><strong>Elizabeth Glista<\/strong>\u00a0is a research scientist at Lawrence Livermore National Laboratory (LLNL). Her research focuses on optimization problems with applications to power system planning, operation, and resilience, including large-scale stochastic planning and non-convex operational problems. At LLNL, she has contributed to internal research projects and to work supported by the U.S. Department of Energy\u2019s Office of Electricity through the Advanced Grid Modeling (AGM) and North American Energy Resilience Model (NAERM) projects. She holds a PhD and an MS in Mechanical Engineering, Controls, from the University of California, Berkeley (2023, 2018) and a BS in Mechanical Engineering from the Massachusetts Institute of Technology (2017). Her work has been recognized with the IEEE Power &amp; Energy Society General Meeting Best Conference Paper Award (2022) and the American Control Conference Best Student Paper Award (2020). Amelia Musselman is an operations research engineer at Lawrence Livermore National Laboratory. She also has experience at Sandia National Laboratories, RAND Corporation, and Pacific Northwest National Laboratory. She holds a Ph.D. in Industrial Engineering and M.S. in Operations Research from Georgia Institute of Technology as well as a B.S. in Mathematics from Harvey Mudd College. Her expertise is in applications of optimization, including multi-objective, stochastic, and robust optimization, to critical infrastructure planning and protection. She has experience working on problems such as stochastic unit commitment, capacity expansion planning, power system and control network restoration, distributed optimization for electric vehicle charging, and other areas of power system planning and protection under uncertainty.<\/p> <p><strong>Tomas Valencia Zuluaga<\/strong>\u00a0is a postdoctoral researcher in the Center for Applied Scientific Computing at Lawrence Livermore National Laboratory (LLNL). His research lies at the intersection of optimization and power systems applications, including planning, operation and electricity markets. At LLNL, he has worked on developing high-performance-computing tools for optimal power grid expansion planning under uncertainty. He obtained his PhD in Industrial Engineering and Operations Research (2024) from UC Berkeley, where he received the IEOR Faculty Fellowship award (2023) and Outstanding Graduate Student Instructor Award (2022). He also holds a MS in Electrical Engineering (2018) and BS in Mechatronics Engineering (2014) from Universidad Nacional de Colombia in Bogot\u00e1, and has professional experience in the Oil &amp; Gas and Power sectors in Colombia.<\/p> <p><strong>Jean-Paul Watson (\"JP\")<\/strong>\u00a0is a Distinguished Member of Technical Staff in the Computational Engineering Division (CED) at Lawrence Livermore National Laboratory (LLNL), in Livermore California. At LLNL, he is the Associate Program Lead for Disaster Resilience in the Global Security Directorate. JP leads a diverse team of researchers focused on developing advanced analytics for critical infrastructure operations, planning, and resilience \u2013 emphasizing decision-making under uncertainty. He is co-inventor of the widely used Pyomo algebraic modeling language for mathematical optimization (www.pyomo.org), and has co-authored over 75 journal articles, 30 conference papers, and 3 books. JP has received the R&amp;D 100 award, the INFORMS Computing Society Prize, and was an INFORMS Edelman finalist.<\/p>\n<h3>GPU-Accelerated Decision Optimization<\/h3> <p>For decades, algorithms for solving decision optimization problems have been designed and implemented for CPUs.\u00a0Recent advances in GPU hardware, driven by machine learning and AI, together with the development of GPU-accelerated scientificcomputing<br>kernels, have made GPUs a practical platform for solving optimization problems. This shift is most visible in linear\u00a0programming, where first-order methods exploit GPU parallelism and high-bandwidth memory to solve problems with millions\u00a0of variables and constraints. GPU algorithms for mixed-integer programming are still emerging, while GPU-based vehicle-routing<br>solvers are more mature and already support large-scale routing applications. At the same time, generative AI and agentic AI\u00a0are changing how optimization models are formulated, solved, and embedded in decision workflows. This tutorial introduces\u00a0GPU-accelerated decision optimization for researchers and practitioners familiar with CPU-based modeling and solvers.We review<br>computational patterns that make optimization algorithms amenable toGPUacceleration, summarize the growing ecosystem of opensource\u00a0and commercial GPU solvers, and provide benchmarks that quantify current performance.We also present cuOpt, NVIDIA\u2019s<br>open-source library for GPU-accelerated decision optimization. Our goal is to help the optimization community understand where\u00a0GPUs are useful today, where important limitations remain, and where future research and development are needed.<\/p> <p><strong>Speakers: Nicolas Blin, Burcin Bozkaya, Akif \u00c7\u00f6rd\u00fck, Chris Maes <\/strong><\/p>\n<ul><li><h4>Speaker Bio<\/h4><p><strong>Nicolas Blin<\/strong> is a senior developer technology engineer at NVIDIA. Nicolas holds an M.Sc. in software engineering. He has a background in image processing and GPU-accelerated algorithms. His interests include massively parallel algorithms, performance optimization, and combinatorial and linear optimization.<\/p> <p><strong>Burcin Bozkaya <\/strong>is a senior developer relations manager at NVIDIA. He holds a BS and MS in Industrial Engineering and PhD in Management Science, specializing in combinatorial optimization problems and heuristic optimization as applied in transportation and logistics, and supply chain planning. As the developer relations lead for decision optimization, Burcin engages with the OR developer ecosystem to evangelize and support the open-source community, ISV partners and key business planners for developing accelerated optimization solvers.<\/p> <p><strong>Akif Coerduek<\/strong> is a senior developer technology engineer at NVIDIA. Akif holds a bachelor\u2019s degree in computer engineering and a master\u2019s degree in software engineering. He has a background in massively parallel pricing engines and GPU-accelerated combinatorial optimization. His interests include parallel algorithms, performance optimization, and combinatorial optimization.<\/p> <p><strong>Christopher Maes<\/strong>\u00a0is a principal engineer on the NVIDIA cuOpt team. He received his PhD in Computational and Mathematical Engineering from Stanford University in 2010. His background and research interests are in linear, quadratic, and mixed-integer programming, as well as trajectory optimization, and machine learning.<br>\"<\/p><\/li><\/ul>\n<p><strong>Nicolas Blin<\/strong> is a senior developer technology engineer at NVIDIA. Nicolas holds an M.Sc. in software engineering. He has a background in image processing and GPU-accelerated algorithms. His interests include massively parallel algorithms, performance optimization, and combinatorial and linear optimization.<\/p> <p><strong>Burcin Bozkaya <\/strong>is a senior developer relations manager at NVIDIA. He holds a BS and MS in Industrial Engineering and PhD in Management Science, specializing in combinatorial optimization problems and heuristic optimization as applied in transportation and logistics, and supply chain planning. As the developer relations lead for decision optimization, Burcin engages with the OR developer ecosystem to evangelize and support the open-source community, ISV partners and key business planners for developing accelerated optimization solvers.<\/p> <p><strong>Akif Coerduek<\/strong> is a senior developer technology engineer at NVIDIA. Akif holds a bachelor\u2019s degree in computer engineering and a master\u2019s degree in software engineering. He has a background in massively parallel pricing engines and GPU-accelerated combinatorial optimization. His interests include parallel algorithms, performance optimization, and combinatorial optimization.<\/p> <p><strong>Christopher Maes<\/strong>\u00a0is a principal engineer on the NVIDIA cuOpt team. He received his PhD in Computational and Mathematical Engineering from Stanford University in 2010. His background and research interests are in linear, quadratic, and mixed-integer programming, as well as trajectory optimization, and machine learning.<br>\"<\/p>","_links":{"self":[{"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/pages\/12076","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/users\/46"}],"replies":[{"embeddable":true,"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/comments?post=12076"}],"version-history":[{"count":66,"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/pages\/12076\/revisions"}],"predecessor-version":[{"id":12525,"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/pages\/12076\/revisions\/12525"}],"wp:attachment":[{"href":"https:\/\/meetings.informs.org\/wordpress\/annual\/wp-json\/wp\/v2\/media?parent=12076"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}