Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion

by   Amir Ahmadi-Javid, et al.

Mixed-Integer Second-Order Cone Programs (MISOCPs) form a nice class of mixed-inter convex programs, which can be solved very efficiently due to the recent advances in optimization solvers. Our paper bridges the gap between modeling a class of optimization problems and using MISOCP solvers. It is shown how various performance metrics of M/G/1 queues can be molded by different MISOCPs. To motivate our method practically, it is first applied to a challenging stochastic location problem with congestion, which is broadly used to design socially optimal service networks. Four different MISOCPs are developed and compared on sets of benchmark test problems. The new formulations efficiently solve large-size test problems, which cannot be solved by the best existing method. Then, the general applicability of our method is shown for similar optimization problems that use queue-theoretic performance measures to address customer satisfaction and service quality.



There are no comments yet.


page 1

page 2

page 3

page 4


A unified approach to mixed-integer optimization: Nonlinear formulations and scalable algorithms

We propose a unified framework to address a family of classical mixed-in...

Location and Capacity Planning of Facilities with General Service-Time Distributions Using Conic Optimization

This paper studies a stochastic congested location problem in the networ...

ReDUCE: Reformulation of Mixed Integer Programs using Data from Unsupervised Clusters for Learning Efficient Strategies

Mixed integer convex and nonlinear programs, MICP and MINLP, are express...

SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs

We study a class of bilevel integer programs with second-order cone cons...

On Training Neural Networks with Mixed Integer Programming

Recent work has shown potential in using Mixed Integer Programming (MIP)...

Cardinality Minimization, Constraints, and Regularization: A Survey

We survey optimization problems that involve the cardinality of variable...

Optimal Solution Predictions for Mixed Integer Programs

Mixed Integer Programming (MIP) is one of the most widely used modeling ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.