INFORMS journal on optimization最新文献_第6页

Tree Bounds for Sums of Bernoulli Random Variables: A Linear Optimization Approach 伯努利随机变量和的树界:一种线性优化方法

INFORMS journal on optimization Pub Date : 2019-10-12 DOI: 10.1287/ijoo.2019.0038

Divya Padmanabhan, K. Natarajan

引用次数: 3

Data-Driven Percentile Optimization for Multiclass Queueing Systems with Model Ambiguity: Theory and Application 具有模型歧义的多类排队系统的数据驱动百分比优化：理论与应用

INFORMS journal on optimization Pub Date : 2019-10-01 DOI: 10.1287/ijoo.2018.0007

Austin Bren, S. Saghafian

引用次数: 4

A Practical Price Optimization Approach for Omnichannel Retailing 一种实用的全渠道零售价格优化方法

INFORMS journal on optimization Pub Date : 2019-08-01 DOI: 10.1287/IJOO.2019.0018

P. Harsha, Shivaram Subramanian, M. Ettl

引用次数: 27

A Branch-and-Cut Approach for the Weighted Target Set Selection Problem on Social Networks 一种求解社交网络加权目标集选择问题的分支割方法

INFORMS journal on optimization Pub Date : 2019-07-08 DOI: 10.1287/IJOO.2019.0012

S. Raghavan, Rui Zhang

引用次数: 20

Three-Dimensional Bin Packing and Mixed-Case Palletization 立体箱包装和混合箱托盘

INFORMS journal on optimization Pub Date : 2019-07-08 DOI: 10.1287/IJOO.2019.0013

S. Elhedhli, Fatma Gzara, Burak Yildiz

引用次数: 26

Effective Budget of Uncertainty for Classes of Robust Optimization 一类鲁棒优化的不确定性有效预算

INFORMS journal on optimization Pub Date : 2019-07-05 DOI: 10.1287/ijoo.2021.0069

Milad Dehghani Filabadi, H. Mahmoudzadeh

{"title":"Effective Budget of Uncertainty for Classes of Robust Optimization","authors":"Milad Dehghani Filabadi, H. Mahmoudzadeh","doi":"10.1287/ijoo.2021.0069","DOIUrl":"https://doi.org/10.1287/ijoo.2021.0069","url":null,"abstract":"Robust optimization (RO) tackles data uncertainty by optimizing for the worst-case scenario of an uncertain parameter and, in its basic form, is sometimes criticized for producing overly conservative solutions. To reduce the level of conservatism in RO, one can use the well-known budget-of-uncertainty approach, which limits the amount of uncertainty to be considered in the model. In this paper, we study a class of problems with resource uncertainty and propose a robust optimization methodology that produces solutions that are even less conservative than the conventional budget-of-uncertainty approach. We propose a new tractable two-stage robust optimization approach that identifies the “ineffective” parts of the uncertainty set and optimizes for the “effective” worst-case scenario only. In the first stage, we identify the effective range of the uncertain parameter, and in the second stage, we provide a formulation that eliminates the unnecessary protection for the ineffective parts and, hence, produces less conservative solutions and provides intuitive insights on the trade-off between robustness and solution conservatism. We demonstrate the applicability of the proposed approach using a power dispatch optimization problem with wind uncertainty. We also provide examples of other application areas that would benefit from the proposed approach.","PeriodicalId":73382,"journal":{"name":"INFORMS journal on optimization","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47110670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs 用支持向量机求解两阶段随机规划的Benders割分类

INFORMS journal on optimization Pub Date : 2019-06-14 DOI: 10.1287/IJOO.2019.0050

Huiwen Jia, Siqian Shen

引用次数: 14

REPR: Rule-Enhanced Penalized Regression 规则增强惩罚回归

INFORMS journal on optimization Pub Date : 2019-05-14 DOI: 10.1287/IJOO.2019.0015

Jonathan Eckstein, Ai Kagawa, Noam Goldberg

引用次数: 10

Learning a Mixture of Gaussians via Mixed-Integer Optimization 通过混合整数优化学习混合高斯函数

INFORMS journal on optimization Pub Date : 2019-04-24 DOI: 10.1287/IJOO.2018.0009

H. Bandi, D. Bertsimas, R. Mazumder

{"title":"Learning a Mixture of Gaussians via Mixed-Integer Optimization","authors":"H. Bandi, D. Bertsimas, R. Mazumder","doi":"10.1287/IJOO.2018.0009","DOIUrl":"https://doi.org/10.1287/IJOO.2018.0009","url":null,"abstract":"We consider the problem of estimating the parameters of a multivariate Gaussian mixture model (GMM) given access to n samples that are believed to have come from a mixture of multiple subpopulations. State-of-the-art algorithms used to recover these parameters use heuristics to either maximize the log-likelihood of the sample or try to fit first few moments of the GMM to the sample moments. In contrast, we present here a novel mixed-integer optimization (MIO) formulation that optimally recovers the parameters of the GMM by minimizing a discrepancy measure (either the Kolmogorov–Smirnov or the total variation distance) between the empirical distribution function and the distribution function of the GMM whenever the mixture component weights are known. We also present an algorithm for multidimensional data that optimally recovers corresponding means and covariance matrices. We show that the MIO approaches are practically solvable for data sets with n in the tens of thousands in minutes and achieve an average improvement of 60%–70% and 50%–60% on mean absolute percentage error in estimating the means and the covariance matrices, respectively, over the expectation–maximization (EM) algorithm independent of the sample size n. As the separation of the Gaussians decreases and, correspondingly, the problem becomes more difficult, the edge in performance in favor of the MIO methods widens. Finally, we also show that the MIO methods outperform the EM algorithm with an average improvement of 4%–5% on the out-of-sample accuracy for real-world data sets.","PeriodicalId":73382,"journal":{"name":"INFORMS journal on optimization","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1287/IJOO.2018.0009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"66363407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Identifying Exceptional Responders in Randomized Trials: An Optimization Approach 在随机试验中识别特殊应答者:一种优化方法

INFORMS journal on optimization Pub Date : 2019-04-16 DOI: 10.1287/IJOO.2018.0006

D. Bertsimas, N. Korolko, Alexander M. Weinstein

引用次数: 10