Essec\Faculty\Model\Contribution {#2233 ▼
#_index: "academ_contributions"
#_id: "14102"
#_source: array:26 [
"id" => "14102"
"slug" => "14102-on-socp-based-disjunctive-cuts-for-solving-a-class-of-integer-bilevel-nonlinear-programs"
"yearMonth" => "2024-07"
"year" => "2024"
"title" => "On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs"
"description" => "GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIS, K. (2024). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. <i>Mathematical Programming</i>, 206, pp. 91-124. 
GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIS, K. (2024). On SOCP-based disjunctive cuts for "
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GAAR Elisabeth"
]
2 => array:1 [
"name" => "LEE Jon"
]
3 => array:1 [
"name" => "SINNL Markus"
]
4 => array:1 [
"name" => "TANINMIS Kubra"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Bilevel optimization"
1 => "Disjunctive cuts"
2 => "Conic optimization"
3 => "Nonlinear optimization"
4 => "Branch-and-cut"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1007/s10107-023-01965-1"
"publicationInfo" => array:3 [
"pages" => "91-124"
"volume" => "206"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary variables. We present an extensive computational study on a diverse set of instances, including instances with binary and with integer variables, and instances with a single and with multiple linking constraints. Our computational study demonstrates that the proposed enhancements of our solution approaches are effective for improving the performance. Moreover, both of our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our binary instances. We study a class of integer bilevel programs with second-order cone constraints at the upper-level a "
"en" => "We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary variables. We present an extensive computational study on a diverse set of instances, including instances with binary and with integer variables, and instances with a single and with multiple linking constraints. Our computational study demonstrates that the proposed enhancements of our solution approaches are effective for improving the performance. Moreover, both of our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our binary instances. We study a class of integer bilevel programs with second-order cone constraints at the upper-level a "
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-04-02T10:21:47.000Z"
"docTitle" => "On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs"
"docSurtitle" => "Articles"
"authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, GAAR Elisabeth, LEE Jon, SINNL Markus, TANINMIS Kubra"
"docDescription" => "<span class="document-property-authors">LJUBIC Ivana, GAAR Elisabeth, LEE Jon, SINNL Markus, TANINMIS Kubra</span><br><span class="document-property-authors_fields">Systèmes d'Information, Data Analytics et Opérations</span> | <span class="document-property-year">2024</span> <span class="document-property-authors">LJUBIC Ivana, GAAR Elisabeth, LEE Jon, SINNL Markus, TANINMI "
"keywordList" => "<a href="#">Bilevel optimization</a>, <a href="#">Disjunctive cuts</a>, <a href="#">Conic optimization</a>, <a href="#">Nonlinear optimization</a>, <a href="#">Branch-and-cut</a> <a href="#">Bilevel optimization</a>, <a href="#">Disjunctive cuts</a>, <a href="#">Conic optimizati "
"docPreview" => "<b>On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs</b><br><span>2024-07 | Articles </span> <b>On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs</b><br>< "
"docType" => "research"
"publicationLink" => "<a href="https://doi.org/10.1007/s10107-023-01965-1" target="_blank">On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs</a> <a href="https://doi.org/10.1007/s10107-023-01965-1" target="_blank">On SOCP-based disjunctive cuts "
]
+lang: "fr"
+"_type": "_doc"
+"_score": 8.969202
+"parent": null
}
