31 citations · 97 across the 10 of their papers we have counts for
10 papers
On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
Samira Fallah, Ted K. Ralphs, Natashia L. Boland
In this study, we investigate the connection between the efficient frontier (EF) of a general multiobjective mixed integer linear optimization problem (MILP) and the so-called rest…
Maximising Throughput in a Complex Coal Export System
Mateus Rocha de Paula, Natashia Boland, Andreas Ernst +2
The Port of Newcastle features three coal export terminals, operating primarily in cargo assembly mode, that share a rail network on their inbound side, and a channel on their outb…
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming
Natashia Boland, Jeffrey Christiansen, Brian Dandurand +3
We present a new primal-dual algorithm for computing the value of the Lagrangian dual of a stochastic mixed-integer program (SMIP) formed by relaxing its nonanticipativity constrai…
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
Brian Dandurand, Natashia Boland, Jeffrey Christiansen +2
We contribute improvements to a Lagrangian dual solution approach applied to large-scale optimization problems whose objective functions are convex, continuously differentiable and…
A polynomially solvable case of the pooling problem
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of l…
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Natashia Boland, Santanu S. Dey, Thomas Kalinowski +2
We investigate how well the graph of a bilinear function can be approximated by its McCormick relaxation. In particular, we are interested in the smallest…