Essec\Faculty\Model\Contribution {#2205
  #_index: "academ_contributions"
  #_id: "14265"
  #_source: array:26 [
    "id" => "14265"
    "slug" => "socp-based-disjunctive-cuts-for-a-class-of-integer-nonlinear-bilevel-programs"
    "yearMonth" => "2022-06"
    "year" => "2022"
    "title" => "SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs"
    "description" => "GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIŞ, K. (2022). SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. Dans: Karen Aardal, Laura Sanità eds. <i>Integer Programming and Combinatorial Optimization</i>. 1st ed. Cham: Springer, pp. 262-276."
    "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" => "TANINMIŞ Kübra"
      ]
    ]
    "ouvrage" => "Integer Programming and Combinatorial Optimization"
    "keywords" => array:5 [
      0 => "Bilevel optimization"
      1 => "Disjunctive cuts"
      2 => "Conic optimization"
      3 => "Nonlinear optimization"
      4 => "Branch-and-cut"
    ]
    "updatedAt" => "2024-02-23 10:27:12"
    "publicationUrl" => "https://link.springer.com/chapter/10.1007/978-3-031-06901-7_20"
    "publicationInfo" => array:3 [
      "pages" => "262-276"
      "volume" => "13265"
      "number" => ""
    ]
    "type" => array:2 [
      "fr" => "Chapitres"
      "en" => "Book chapters"
    ]
    "support_type" => array:2 [
      "fr" => "Editeur"
      "en" => "Publisher"
    ]
    "countries" => array:2 [
      "fr" => null
      "en" => null
    ]
    "abstract" => array:2 [
      "fr" => "We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish 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 a preliminary computational study on instances with no second-order cone constraints at the upper level and a single linear constraint at the lower level. Our study demonstrates that both 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 test instances, where the non-linearities are linearized in a McCormick fashion."
      "en" => "We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish 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 a preliminary computational study on instances with no second-order cone constraints at the upper level and a single linear constraint at the lower level. Our study demonstrates that both 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 test instances, where the non-linearities are linearized in a McCormick fashion."
    ]
    "authors_fields" => array:2 [
      "fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
      "en" => "Information Systems, Decision Sciences and Statistics"
    ]
    "indexedAt" => "2024-05-08T09:21:54.000Z"
    "docTitle" => "SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs"
    "docSurtitle" => "Chapitres"
    "authorNames" => "<a href="/cv/ljubic-ivana">LJUBIC Ivana</a>, GAAR Elisabeth, LEE Jon, SINNL Markus, TANINMIŞ Kübra"
    "docDescription" => "<span class="document-property-authors">LJUBIC Ivana, GAAR Elisabeth, LEE Jon, SINNL Markus, TANINMIŞ Kübra</span><br><span class="document-property-authors_fields">Systèmes d’Information, Sciences de la Décision et Statistiques</span> | <span class="document-property-year">2022</span>"
    "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>"
    "docPreview" => "<b>SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs</b><br><span>2022-06 | Chapitres </span>"
    "docType" => "research"
    "publicationLink" => "<a href="https://link.springer.com/chapter/10.1007/978-3-031-06901-7_20" target="_blank">SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs</a>"
  ]
  +lang: "fr"
  +"_type": "_doc"
  +"_score": 8.566441
  +"parent": null
}