Treffer: A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming.

Title:
A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming.
Source:
Communications in Combinatorics & Optimization; Dec2025, Vol. 10 Issue 4, p837-875, 39p
Database:
Complementary Index

Weitere Informationen

One of the chief attractions of stochastic mixed-integer second-order cone programming is its diverse applications, especially in engineering (Alzalg and Alioui, IEEE Access, 10:3522-3547, 2022). The linear and nonlinear versions of this class of optimization problems are still unsolved yet. In this paper, we develop a hybrid optimization algorithm coupling branch-and-bound and primal-dual interior-point methods for solving two-stage stochastic mixed-integer nonlinear second-order cone programming. The adopted approach uses a branch-and-bound technique to handle the integer variables and an infeasible interiorpoint method to solve continuous relaxations of the resulting subproblems. The proposed hybrid algorithm is also implemented to data to show its efficiency. [ABSTRACT FROM AUTHOR]

Copyright of Communications in Combinatorics & Optimization is the property of Azarbaijan Shahid Madani University and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)