BKBurak Kocuk

Burak Kocuk

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Burak Kocuk has a total of 43 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Global Optimization of Gas Transportation and Storage: Convex Hull Characterizations and Relaxations

    by Bahar Cennet Okumuşoğlu, Bahar Cennet, Burak Kocuk

    Gas transportation and storage has become one of the most relevant and important optimization problems in energy systems. This problem inherently includes highly nonlinear and nonconvex aspects due to gas physics, and discrete aspects due to the control decisions of active network elements. Obtaining even locally optimal solutions for this problem presents significant mathematical and computational challenges for system operators. In this paper, we formulate the gas transportation and storage problem as a nonconvex mixed-integer nonlinear program (MINLP) through disjunctions on the flow directions. Moreover, we study the nonconvex sets induced by gas physics and propose mixed-integer second-order cone programming relaxations for the nonconvex MINLP problem. The proposed relaxations are based on the convex hull representations of two nonconvex sets: Firstly, we give the convex hull representation of the nonconvex set for pipes and show that it is second-order cone representable. Secondly, we also give a complete characterization of the extreme points of the nonconvex set for compressors and show that the convex hull of the extreme points is power cone representable. Moreover, for practical applications, we propose a second-order cone outer-approximation for the nonconvex set for compressors. To obtain (near) globally optimal solutions, we develop an algorithmic framework based on our convex hull results. We evaluate our framework through extensive computational experiments on various GasLib networks in comparison with the convex relaxations from the literature and a state-of-the-art global solver. Our results highlight the computational efficiency and convergence performance of our convex relaxation method compared to other methods. Moreover, our method also consistently provides (near) global solutions as well as high-quality warm-starting points for local solvers.

  • Open Access

    On The Integrality Gap of Convex Mixed-Integer Programs

    by Burak Kocuk, Diego A. Moran Ramirez

    We study the integrality gap of convex mixed-integer programs, that is, the difference between the optimal value of such a problem and the optimal value of its continuous relaxation. We study classes of convex sets whose associated optimization problem have finite integrality gap: Dirichlet convex sets, sets with full-dimensional recession cones and sets that can be approximated by polyhedral sets. In the latter two cases, we provide estimates for the value of the integrality gap. Finally, we study the possibility of estimating the integrality gap of nonlinear convex mixed-integer programs via rational polyhedral approximations of their feasible regions and argue that, in general, such an approach may yield arbitrarily worse bounds compared to integrality gap estimations specifically derived by studying the associated nonlinear set.

  • Open Access

    MIQCP and MISOCP-Based Solution Methods for the Multi-Layer Thin Films Problem

    by Deniz Tuncer, Burak Kocuk

    The Multi-Layer Thin Films Problem is a materials science problem that aims to enhance the reflectance of a metallic substrate by designing multi-layer coatings composed of different dielectric materials and thicknesses. While previous studies on the problem mostly rely on heuristic approaches and are designed for single wavelength applications, this work addresses the problem using global optimization techniques for multiple wavelengths. We develop an exact nonconvex mixed-integer quadratically constrained programming (MIQCP) model to solve this problem. We also develop a mixed-integer second-order cone programming relaxation that has computational advantage over the MIQCP model. Our numerical experiments yield solutions that have average reflectance of 99% over the visible spectrum (380-770 nm) and 95% over the broad spectrum (300-3000 nm).

  • Open Access

    Solving the Heilbronn Triangle Problem using Global Optimization Methods

    by Amirhossein Monji, Amirali Modir, Burak Kocuk

    We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly non-linear and non-convex due to the existence of bilinear terms and absolute value equations. We propose two mixed-integer quadratically constrained programming (MIQCP) and one QCP formulation, which can be readily solved by any global optimization solver. We develop several formulation enhancements in the form of bound tightening and symmetry breaking inequalities that are prevalent in the global optimization literature in addition to other enhancements that exploit the problem structure. With the help of these enhancements, our models reproduce proven optimal values for instances up to n = 8 points with certified optimality in the order of seconds. In the case of n = 9 points, for which no analytical proof is known, we establish a certified optimal value by a computational effort of one day. This is a significant improvement over the previous benchmark established in 31 days of computations by Chen et al. (2017).

  • Open Access

    Convexification of a Separable Function over a Polyhedral Ground Set

    by Santanu S. Dey, Burak Kocuk

    In this paper, we study the set $\mathcal{S}^κ= \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^κ, j=1,\dots,n\}$, where $κ> 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This nonconvex set is closely related to separable standard quadratic programming and appears as a substructure in potential-based network flow problems from gas and water networks. Our aim is to obtain the convex hull of $\mathcal{S}^κ$ or its tight outer-approximation for the special case when the ground set $\mathcal{G}$ is the standard simplex. We propose power cone, second-order cone and semidefinite programming relaxations for this purpose, which are further strengthened by the Reformulation-Linearization Technique and the Reformulation-Perspectification Technique. For $κ=2$, we obtain the convex hull of $\mathcal{S}^κ$ in the low-dimensional setting. For general $κ$, we give approximation guarantees for the power cone representable relaxation, the weakest relaxation we consider. We prove that this weakest relaxation is tight with probability one as $n\to\infty$ when a uniformly generated linear objective is optimized over it. Finally, we provide the results of our extensive computational experiments comparing the empirical strength of several conic programming relaxations that we propose.

  • Open Access

    A Stochastic Programming Approach to the Railcar Maintenance Problem with Service Level and Track Capacity Considerations

    by Murat Elhüseyni, Burak Kocuk

    Railcars, as part of the rolling stock, perform regular transportation tasks with respect to a service level agreement (SLA) and undergo preventive maintenance at regular intervals based on the recommendations of train manufacturers. When unexpected failures occur, they need to enter corrective maintenance immediately. However, this reactive approach may result in large SLA violations and an excessive number of corrective maintenance actions. In this study, we utilize a predictive maintenance approach based on the reliability of a railcar. In particular, we propose a stochastic programming model, in which railcar failure scenarios are generated from a Weibull distribution, a common assumption in the reliability literature. The model incorporates both SLA and track-capacity considerations and is solved through the Sample Average Approximation (SAA) method. We generate random instances to compare the stochastic model and a deterministic model adopted from the literature with respect to several system parameters. Our results show that the stochastic model achieves lower total costs, fewer SLA violations, and a reduced number of corrective interventions compared with deterministic approaches, while effectively managing track-capacity constraints. Our results underscore the importance of the predictive approach in the context of the railcar maintenance problem.

  • Open Access

    Improved Rank-One-Based Relaxations and Bound Tightening Techniques for the Pooling Problem

    by Mosayeb Jalilian, Burak Kocuk

    The pooling problem is a classical NP-hard problem in the chemical process and petroleum industries. This problem is modeled as a nonlinear, nonconvex network flow problem in which raw materials with different specifications are blended in some intermediate tanks and mixed again to obtain the final products with the desired specifications. The analysis of the pooling problem is quite an active research area, and different exact formulations, relaxations, and restrictions are proposed. In this paper, we focus on a recently proposed rank-one-based formulation of the pooling problem. In particular, we study a recurring substructure in this formulation defined by the set of nonnegative, rank-one matrices with bounded row sums, column sums, and the overall sum. We show that the convex hull of this set is second-order cone representable. In addition, we propose an improved compact-size polyhedral outer-approximation and families of valid inequalities for this set. To further strengthen these convexification approaches, we develop two bound tightening techniques that refine the capacities of source, pool, and terminal nodes, as well as flow bounds on arcs. One is a simple, rule-based approach using network structure (e.g., supply, demand, and neighboring capacities), while the other solves auxiliary optimization problems to compute tighter bounds. Our computational experiments show that the newly proposed polyhedral outer-approximation can improve upon the traditional linear programming relaxations of the pooling problem in terms of the dual bound. Furthermore, bound tightening techniques reduce the computational time spent on both the exact method, linear programming, and mixed-integer linear programming relaxations.