Accepting Your Offer of Admission. Rajan is currently working as a postdoctoral researcher at Columbia University where he works with Vineet Goyal and Garud Iyengar. 2022: Adwords with Unknown Budgets. Rajan Udwani: Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint. Vineet Goyal, Garud Iyengar, Rajan Udwani We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources are used or rented for a stochastic duration that is drawn independently from known distributions. Rajan Udwani is an Assistant Professor of Industrial Engineering and Operations Research at UC Berkeley. Fertility Biocenter Ano Tzoumagias 63, Thessaloniki 544 53, Greece Coordinate: 40. Schulz, Rajan Udwani (Submitted on 23 Jul 2015 ( v1 ), revised 5 May 2016 (this version, v3), latest version 15 Nov 2017 ( v4 )) Abstract: We consider a robust formulation, introduced by Krause et al. I am co-advised by Professor David Simchi-Levi and Professor James Orlin. Rajan received his PhD in Operations Research from MIT and subsequently did a postdoc at Columbia University. IPCO 2016: 312-324 2015 [c2] Mohsen Ghaffari, Rajan Udwani:. Prior to joining UC Berkeley, he was a postdoctoral researcher at Columbia University. Please join us for our next seminar of spring semester in person. The conference version appeared in ACM Conference on Economics & Computations (EC), 2022. Iyengar, and Rajan Udwani: Session MD03 Fair Exploration via Axiomatic. 358 km 2 [2] and a population of. A wide range of applications, ranging from online advertising and labor markets to networks and platforms, will be presented. Rajan Udwani We consider a robust formulation, introduced by Krause et al. Rajan Udwani – University of California, Berkeley Kaizheng Wang – Columbia University Weijun Xie – Georgia Institute of Technology Fasheng Xu – Syracuse University Chiwei Yan – University of Washington, Seattle Rui Zhang – University of Colorado, Boulder Hao Zhong – ESCP Business School Luis Zuluaga – Lehigh University. Previously, he completed a PhD in Operations Research at MIT, where he was. Rajan Udwani UC Berkeley Shuangyu Wang Columbia University Date Written: February 25, 2019 Abstract We consider an online assortment optimization problem where we have n substitutable products with fixed reusable capacities c1,,cn. 9706957 Phone: +30 231 092 1000 (fertility-biocenter. In particular, when a resource is matched it is unavailable for a deterministic time duration after which it becomes available for a re-match. Online Matching with Stochastic Rewards: : Optimal. My current research interests lie broadly in supply chain, sustainability, reinforcement learning,. Iyengar Columbia University Verified email at columbia. Part of Advances in Neural Information Processing Systems 31 (NeurIPS 2018). Health Analytics at Georgia Tech bridges fundamental mathematical and computational modeling with health services research and health economics as a means of translating health and healthcare data into knowledge and decision making. Rajan Udwani – University of California, Berkeley Kaizheng Wang – Columbia University Weijun Xie – Georgia Institute of Technology Fasheng Xu – Syracuse University Chiwei Yan – University of Washington, Seattle Rui Zhang – University of Colorado, Boulder Hao Zhong – ESCP Business School Luis Zuluaga – Lehigh University. He works on algorithms for optimization under uncertainty with a focus on revenue management and pricing. Vineet Goyal and Rajan Udwani. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. 02430v3] Online Allocation of Reusable Resources: …. 06616v4] Robust Monotone Submodular Function Maximization. Rajan Udwani We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are. But this work with collaborators Iyengar and postdoctoral researcher Rajan Udwani is motivated by modern applications of sharing economies where resource capacities can be reused after they have finished serving a demand, for instance, servers in cloud computing. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. Rajan Udwani is an Assistant Professor of Industrial Engineering and Operations Research at UC Berkeley. (Photo by Kalman Zabarsky) Name: Rajan Udwani Discipline: Engineering Degrees: B. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. Rajans education is listed on their profile. Institute for Data, Systems, and. Rajan Udwani Receives Google Research >Berkeley IEOR Professor Rajan Udwani Receives Google Research. Wagner Prize for Excellence in the Practice of Advanced Analytics and Operations Research. Tuesday, Wednesday & Thursday from 9am-12pm and 1-4pm. Periodic Reranking for Online Matching of Reusable Resources. Online primal dual meets online matching with stochastic. Operations Research 71(2):563-580. Office: 304 Mudd Tel: (212) 854-0345 I am Associate Professor in the Industrial Engineering and Operations Research department at Columbia University. Rajan Udwani. He also spent a couple of years as a postdoctoral researcher at Columbia University. Rajan Udwani is an assistant professor of industrial engineering and operations research at the University of California Berkeley. Vineet Goyal, Rajan Udwani The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. Adwords with Unknown Budgets. Revenue Management and Pricing Section Conference>INFORMS Revenue Management and Pricing Section Conference. The museum was founded in 1979 by a group of visionary citizens of Thessaloniki. He has also previously worked as a quantitative analyst and holds a B. Authors: James B. From Adwords to Online Matching with Stochastic Rewards, and …. Ippokrateio General Hospital of Thessaloniki. (Photo by Kalman Zabarsky) Name: Rajan Udwani Discipline: Engineering Degrees: B. Rajan Udwani UC Berkeley Date Written: October 23, 2022 Abstract We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are reusable. Rajan Udwani is a professor in the Industrial Engineering department at University of California Berkeley - see what their students are saying about them or leave a rating yourself. ICS 269, Fall 2022: Theory Seminar Bren Hall 1427, 1:00 – 1:50 14 October 2022 Almost Tight Bounds for Online Hypergraph Matching Thorben Trobst. Rajan Udwani: Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint. [J13] “Fair Dynamic Rationing”, Management Science (MS), 2023. In particular, when a resource is matched to an online vertex it is unavailable for a deterministic. Vineet Goyal (Curriculum Vitae). April 21, 2023 Berkeley IEOR Professor Rajan Udwani has been awarded the highly competitive Google Research Scholar award for 2023-24 in recognition of his proposal on algorithms and optimization, titled “Generalized Framework for Prior-Free Online Resource Allocation. 2345 Abstract The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. Authors:Vineet Goyal, Garud Iyengar, Rajan Udwani Download a PDF of the paper titled Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources, by Vineet Goyal and 2 other authors Download PDF Abstract:We consider the problem of online allocation (matching, budgeted allocations,. Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources, Vineet Goyal, Garud N. My current research focuses majorly on (i) Online Resource Allocation and Algorithmic Pricing and (ii) Algorithmic Mechanism Design, both with applications in designing online marketplaces, platforms, and operations of non-profit organizations (or governmental agencies). Multi-objective Maximization of Monotone Submodular Functions with Cardinality Constraint. ISyE Seminar: “Submodular Order Functions and Assortment. University of California, Berkeley. Vineet Goyal, Garud Iyengar, Rajan Udwani We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources are used or rented for a stochastic duration that is drawn independently from known distributions. Schulz, Rajan Udwani (Submitted on 23 Jul 2015 ( v1 ), last revised 15 Nov 2017 (this version, v4)) Abstract: We consider a robust formulation, introduced by Krause et al. Industrial Engineering and Operations Research, University of California Berkeley, Berkeley, California 94720, Shuangyu Wang. RAJAN UDWANI,Columbia University The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. Articles Cited by Public access. Rajan received his PhD in Operations Research from MIT and subsequently did a postdoc at Columbia University. (Photo by Kalman Zabarsky) Name: Rajan Udwani Discipline: Engineering Degrees: B. Εξπρες Σερβις Kathigitou Rossidou 1, Thessaloniki 546 55. Online Matching with Stochastic Rewards: Optimal Competitive. When a match is made it succeeds with the probability of the corresponding edge. 03983] Online Allocation of Reusable Resources via. Tech in Electrical Engineering from IIT Bombay. Institute for Data, Systems, and Society, Department of Civil and Environmental Engineering and Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139;. Rajan is currently working as a postdoctoral researcher at Columbia University where he works with Vineet Goyal and Garud. (2008), of the classic cardinality constrained monotone submodular function maximization problem, and give. Kordelio-Evosmos ( Greek: Κορδελιό-Εύοσμος, Kordelió-Évosmos) is a municipality of the Thessaloniki Urban Area in the regional unit of Thessaloniki, Central Macedonia, Greece. Rajan Udwani: Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint. Under Review (2020) Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation (joint with Rajan Udwani). He has also previously worked as a quant and holds a B. To retain your original documents visit 316 Sproul Hall where we can certify/photocopy them and return the originals. Berkeley IEOR Professor Rajan Udwani Receives Google Research. Rajan Udwani>Berkeley IEOR Welcomes New Assistant Professor Rajan Udwani. of Computer Science and Engineering,. Rajan Udwani UC Berkeley Date Written: October 23, 2022 Abstract We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are reusable. 02743v1] Submodular Order Functions and Assortment. Real time applications require strict delay guarantee, i. Rajan Udwani is an Assistant Professor of Industrial Engineering and Operations Research at UC Berkeley. V Goyal, G Iyengar, R Udwani. Rajan Udwani We consider a generalization of the vertex weighted online bipartite matching problem where the offline vertices, called resources, are reusable. (2008), of the classic cardinality constrained monotone submodular function maximization problem, and give the first. Institute of Transportation Studies (ITS). Authors:Vineet Goyal, Garud Iyengar, Rajan Udwani Download a PDF of the paper titled Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources, by Vineet Goyal and 2 other authors Download PDF Abstract:We consider the problem of online allocation (matching, budgeted allocations,. Rajan’s education is listed on their profile. INFORMS Revenue Management and Pricing Section …. in Operations Research from MIT and subsequently did a postdoc at Columbia University. Farias Batching and Optimal Multi-stage Bipartite Allocations, Rad Niazadeh and Yiding Feng. Steven Delong, Alireza Farhadi, Rad Niazadeh, Balasubramanian Sivan, Rajan Udwani. [1] The municipality has an area of 13. Online Bipartite Matching with Reusable Resources. The aim of this interdisciplinary seminar is to discuss pioneering and impactful work in the broad area of market design. Rajan is currently working as a postdoctoral researcher at Columbia University where he works with Vineet Goyal and Garud Iyengar. My current research focuses majorly on (i) Online Resource Allocation and Algorithmic Pricing and (ii) Algorithmic Mechanism Design, both with applications in designing online marketplaces, platforms, and operations of non-profit organizations (or governmental agencies). Kenny Song University of Tokyo Verified email at ms. Online stochastic weighted matching: Improved approximation algorithms. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. Authors:Vineet Goyal, Garud Iyengar, Rajan Udwani Download PDF Abstract:We study the problem of allocating a given set of resources to sequentially arriving demand when the resources are reusable i. Customers arrive sequentially and the total number of customers is known to the seller. Abstract: Consider the problem of matching hyperedges in a k-uniform hypergraph in an online fashion. Health Analytics @ Georgia Tech. The seat of the municipality is in Evosmos. Assistant Professor, Civil and Environmental Engineering. New DSI Member Vineet Goyal Designs Algorithms for Sequential. I am co-advised by Professor David Simchi-Levi and Professor James Orlin. Online Bipartite Matching with Reusable Resources. Berkeley IEOR Professor Rajan Udwani has been awarded the highly competitive Google Research Scholar award for 2023-24 in recognition of his proposal on algorithms and optimization, titled “Generalized Framework for Read More Berkeley IEOR Professor Receives Prestigious INFORMS President’s Award. [Link] [SSRN] [arXiv] With Vahideh Manshadi and Scott Rodilitz. Tech in Electrical Engineering from IIT Bombay and a PhD in Operations Research from MIT. Rajan Udwanis 8 research works with 42 citations and 284 reads, including: Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation. INFORMS Revenue Management and Pricing Section Conference. Rajan Udwani UC Berkeley Verified email at berkeley. Theoretical, computational, and experimental work as well as field studies will be featured. Dynamic Pricing for a Large Inventory of Substitutable Goods. Vineet Goyal, Rajan Udwani: Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. IPCO 2016: 312-324 2015 [c2] Mohsen Ghaffari, Rajan Udwani:. This seminar will feature Rajan Udwani from the University of California Berkeley who will discuss submodular order functions and assortment optimization. See the complete profile on LinkedIn and discover Rajan’s. Rajan received his PhD in Operations Research from MIT and subsequently did a postdoc at Columbia University. Rajan Udwani Assistant Professor Dept of Industrial Engineering & Operations Research Faculty URL Contact Update your profile Research Expertise and Interest algorithms, optimization under uncertainty, Revenue Management, pricing, online platforms Research Description. Rajan Udwani Authors Info & Claims Operations Research Volume 71 Issue 2 01 March 2023pp 563–580 https://doi. Rajan Udwani UC Berkeley Date Written: October 23, 2022 Abstract We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are reusable. edu Biography Expand Rajan received his PhD in Operations Research from MIT…. Rajan Udwani UC Berkeley Date Written: March 12, 2022 Abstract We consider the problem of pricing a large inventory of substitutable products over a finite planning horizon. Vineet Goyal, Rajan Udwani (2022) Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path-Based Formulation. Rajan Udwani UC Berkeley Date Written: February 2, 2022 Abstract Discrete choice models are widely used for understanding how customers choose between a variety of substitutable goods. Schulz, Rajan Udwani: Robust Monotone Submodular Function Maximization. Auctions and Market Design Online Seminar Series. Thessaloniki, Central Macedonia, Greece, is the second largest city in Greece and has always been an important transport hub. Rajan Udwani UC Berkeley Date Written: March 12, 2022 Abstract We consider the problem of pricing a large inventory of substitutable products over a finite planning horizon. Vineet Goyal, Rajan Udwani: Online Matching with Stochastic Rewards: Optimal Competitive Ratio via Path Based Formulation. Aerospace Engineering; Bioengineering; Civil and Environmental Engineering; Electrical Engineering and Computer Sciences; Engineering Science. Today, as an associate professor in Columbia’s Department of Industrial Engineering and Operations Research (IEOR), he focuses on designing algorithms for sequential learning and optimization under uncertainty, work that has wide applications in revenue management, resource allocation, health care, and energy markets. Maria Laura Delle Monache. Meet our new faculty: Rajan Udwani, engineering. Home Page of Vineet Goyal. Assistant Professor Industrial Engineering and Operations Research Ph. Rajan Udwanis research works. 9544644 Phone: +30 231 042 5901 (www. Prior to joining UC Berkeley he was a postdoctoral. He has also previously worked as a quant and holds a B. Thesis supervisor for Rajan Udwani 2018 Title: Robust optimization for submodular function minimization. Rajan Udwani We consider a robust formulation, introduced by Krause et al. Rajan Udwani is a new member of the UC Berkeley faculty. Vineet Goyal and Rajan Udwani. See the complete profile on LinkedIn and. We refer to this permutation as a submodular order. Thesis supervisor for Berit Johannes 2011 Technical University of Berlin Title: New Classes of Complete Problems for the Second Level of the Polynomial Hierarchy. Please join us for our next seminar of spring semester in person. Rajan is currently working as a postdoctoral researcher at Columbia University where he works with Vineet Goyal and Garud Iyengar. In particular, when a resource is matched to an online vertex it is unavailable for a. Rajan Udwani at University of California Berkeley. Bernhard Haeupler, Vahab S Mirrokni, and Morteza Zadimoghaddam. , MIT, 2018 Research interests: Design of efficient and theoretically sound algorithms for solving operational problems, and revenue management for online platforms. Rajan Udwani Supporting real-time applications is paramount to sustaining the growth of wireless networks. University of California, Berkeley. Rajan Udwani is a new member of the UC Berkeley faculty. In a conversation between Maro Lagia and gallerist and collector Alexandros Iolas, after the latter had shown a keen interest in the damage inflicted on monuments by the 1978 Thessaloniki earthquake, Lagia proposed the creation of a contemporary art centre in Thessaloniki. Rajan Udwani Published Online: 29 Aug 2022 https://doi. Rajan received his Ph. Under Review (2020) A Generalized Markov Chain Model to Capture Dynamic Preferences and Choice Overload (joint with Goutam Kumar and Agathe Soret). Berkeley IEOR Professor Rajan Udwani has been awarded the highly competitive Google Research Scholar award for 2023-24 in recognition of his proposal on algorithms and optimization, titled “Generalized Framework for Prior-Free Online Resource Allocation. He has also previously worked as a quantitative analyst and. Rajan’s education is listed on their profile. Plato - Diagnostic Center Themistokli Sofouli 14, Thessaloniki 546 46, Greece Coordinate: 40. He works on algorithms for optimization. edu Contact Collapse Email: [email protected]. Bio: Rajan Udwani is an Assistant Professor of Industrial Engineering and Operations Research at UC Berkeley. Berkeley IEOR Welcomes New Assistant Professor …. Drop Off at 318 Sproul Hall in the transcript drop box. Rajan Udwani – University of California, Berkeley Kaizheng Wang – Columbia University Weijun Xie – Georgia Institute of Technology Fasheng Xu – Syracuse University Chiwei Yan – University of Washington, Seattle Rui Zhang – University of Colorado, Boulder Hao Zhong – ESCP Business School Luis Zuluaga – Lehigh University. in Electrical Engineering from IIT Bombay. Algorithms Optimization Operations Research Revenue Management. This class of functions includes monotone submodular functions as a sub-family. See the complete profile on LinkedIn and discover Rajans. Rajan Udwani UC Berkeley Shuangyu Wang Columbia University Date Written: February 25, 2019 Abstract We consider an online assortment optimization. Iyengar, and Rajan Udwani: Session MD03 Fair Exploration via Axiomatic Bargaining, Jackie Baek and Vivek F. Rajan’s education is listed on their profile. Berkeley IEOR Professor Rajan Udwani has been awarded the highly competitive Google Research Scholar award for 2023-24 in recognition of his proposal on algorithms and optimization, titled “Generalized Framework for Prior-Free Online Resource Allocation. Shustek Professor of Computer Science, Dept. - Reception, coffee and cookiesRajan Udwani Assistant Professor Industrial Engineering and Operations Research University of California. Online Assortment Optimization with Reusable Resources. Rajan Udwani We consider a generalization of the vertex weighted online bipartite matching problem where the offline vertices, called resources, are reusable. Rajan Udwani is a professor in the Industrial Engineering department at University of California Berkeley - see what their students are saying about them or leave a rating yourself. Delong, Steven and Farhadi, Alireza and Niazadeh, Rad and Sivan, Balasubramanian and Udwani, Rajan, Online Bipartite Matching with Reusable Resources (October 23, 2022). Berkeley Engineering>New faculty members. We investigate the relationship between two well studied choice models, the Nested Logit (NL) model and the Markov choice model. Rajan Udwani is a new member of the UC Berkeley faculty. ISyE Seminar Series: Rajan Udwani. Rajan received his Ph. Office: 304 Mudd Tel: (212) 854-0345 I am Associate Professor in the Industrial Engineering and Operations Research department at Columbia University. 06428 ( 2017) 2016 [c3] James B. Theory Seminar, 14 October 2022. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. Online matching with stochastic rewards: Optimal competitive ratio via path based formulation. View Rajan Udwani’s profile on LinkedIn, the world’s largest professional community. Rajan Udwani UC Berkeley Date Written: March 12, 2022 Abstract We consider the problem of pricing a large inventory of substitutable products over a finite planning horizon. Berkeley IEOR Welcomes New Assistant Professor Rajan Udwani. Rajan Udwani Published Online: 29 Aug 2022 https://doi. Rajan Udwani is an Assistant Professor of Industrial Engineering and Operations Research at UC Berkeley. Rajan Udwani UC Berkeley Date Written: March 12, 2022 Abstract We consider the problem of pricing a large inventory of substitutable products over a finite. Rajan Udwani We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. 02430] Asymptotically Optimal Competitive Ratio for. ICS 269, Fall 2022: Theory Seminar Bren Hall 1427, 1:00 – 1:50 14 October 2022 Almost Tight Bounds for Online Hypergraph Matching Thorben Trobst. Previously, he completed a PhD in Operations Research at MIT, where he was advised by James B. 2345 Published: 01 March 2023 Publication History 0 0 Metrics Total Citations 0 Total Downloads 0 Last 12 Months 0 Last 6 weeks 0 Operations Research Volume 71, Issue 2 Abstract References Recommendations Comments. Thesis supervisor for Rajan Udwani 2018 Title: Robust optimization for submodular function minimization. Rajan Udwani We consider a robust formulation, introduced by Krause et al. Health Analytics @ Georgia Tech. 2022: Adwords with Unknown Budgets and Beyond. , any allocated resource is More concretely, we are given resources with fixed reusable inventory. This is a classical problem arising in many applications. See the complete profile on LinkedIn and discover Rajan’s. Today, as an associate professor in Columbia’s Department of Industrial Engineering and Operations Research (IEOR), he focuses on designing algorithms for sequential learning and optimization under uncertainty, work that has wide applications in revenue management, resource allocation, health care, and energy markets. , Massachusetts Institute of Technology Personal Webpage: https://rudwani. Iyengar and Rajan Udwani). Rajan Udwani is an assistant professor of industrial engineering and operations research at the University of California Berkeley. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor. 03983] Online Allocation of Reusable Resources via …. Rajan Udwani is a new member of the UC Berkeley faculty. New DSI Member Vineet Goyal Designs Algorithms for …. I received my PhD in Algorithms, Combinatorics and Optimization (ACO) in 2008 from Tepper School of Business, CMU where my advisor was R. Prior to joining UC Berkeley he was a postdoctoral researcher at Columbia University. Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources, Vineet Goyal, Garud N. April 21, 2023 Berkeley IEOR Professor Rajan Udwani has been awarded the highly competitive Google Research Scholar award for 2023-24 in recognition of his proposal on algorithms and optimization, titled “Generalized Framework for Prior-Free Online Resource Allocation. Rajan Udwani Professor in the Industrial Engineering department at University of California Berkeley 50% Would take again 5 Level of Difficulty Rate Professor Udwani Im. Vineet Goyal, Rajan Udwani The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. View Rajan Udwanis profile on LinkedIn, the worlds largest professional community. Schulz, Rajan Udwani: Robust Monotone Submodular Function Maximization. The aim of this interdisciplinary seminar is to discuss pioneering and impactful work in the broad area of market design. My current research interests lie broadly in supply chain, sustainability, reinforcement learning, assortment optimization, pure exploration for clinical trials, and data-driven decision making in general. With Steven Delong, Alireza Farhadi, Balu Sivan and Rajan Udwani. Rajan Udwani06616v3] Robust Monotone Submodular Function Maximization. 12778] Online Matching with Stochastic Rewards: Optimal. See the complete profile on LinkedIn and discover Rajan’s.