Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Improved Benders decomposition approach to complete robust optimization in box-interval

Bulletin of Electrical Engineering and Informatics · Vol. 11 No. 5 (2022) · hlm. 2949–2957

DOI
10.11591/eei.v11i5.4394
ISSN
2089-3191, 2302-9285
Terbit
2022-08-19
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

Robust optimization is based on the assumption that uncertain data has a convex set as well as a finite set termed uncertainty. The discussion starts with determining the robust counterpart, which is accomplished by assuming the indeterminate data set is in the form of boxes, intervals, box-intervals, ellipses, or polyhedra. In this study, the robust counterpart is characterized by a box-interval uncertainty set. Robust counterpart formulation is also associated with master and subproblems. Robust Benders decomposition is applied to address problems with convex goals and quasiconvex constraints in robust optimization. For all data parameters, this method is used to determine the best resilient solution in the feasible region. A manual example of this problem's calculation is provided, and the process is continued using production and operations management–quantitative methods (POM-QM) software.

Kata kunci

Jaringan kolaborasi para penulis

24 penulis · 57 tautan kepenulisan bersama · 14 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Sumatera Utara
  • Universitas Islam Negeri Sumatera Utara
  • North Sumatra Islamic University
  • Universitas Bumigora
  • Universitas Bina Sarana Informatika
  • University of Brawijaya
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Syahril EfendiUniversitas Sumatera Utara6
Muhammad ZarlisUniversitas Sumatera Utara4
Hengki Tamando SihotangUniversitas Sumatera Utara2
Anna Angela SitinjakUniversitas Sumatera Utara2
Gayus SimarmataUniversitas Sumatera Utara2
Opim Salim SitompulUniversitas Sumatera Utara2
Dadang PriyantoUniversitas Bumigora1
Mochamad WahyudiUniversitas Bina Sarana Informatika1
Desi VinsensiaAfiliasi tidak diketahui1
Erna Budhiarti NababanUniversitas Sumatera Utara1
Heru MardiansyahUniversitas Sumatera Utara1
Nurjannah NurjannahUniversity of Brawijaya1
Rima ApriliaUniversitas Islam Negeri Sumatera Utara1
Linna SyahputriNorth Sumatra Islamic University1
widya panjaitanNorth Sumatra Islamic University1
Poltak SihombingUniversitas Sumatera Utara1
Paska Marto HasugianUniversitas Sumatera Utara1
M. SafiiUniversitas Sumatera Utara1
Rina WidyasariUniversitas Islam Negeri Sumatera Utara1
Raisha Zuhaira DongoranUniversitas Islam Negeri Sumatera Utara1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Improved Benders decomposition approach to complete robust optimization in box-interval</dc:title><dc:creator>Hendra Cipta</dc:creator><dc:creator>Saib Suwilo</dc:creator><dc:creator>Sutarman Sutarman</dc:creator><dc:creator>Herman Mawengkang</dc:creator><dc:subject>robust optimization</dc:subject><dc:subject>Benders decomposition</dc:subject><dc:subject>robust counterpart</dc:subject><dc:subject>data uncertainty</dc:subject><dc:description xml:lang="en">Robust optimization is based on the assumption that uncertain data has a convex set as well as a finite set termed uncertainty. The discussion starts with determining the robust counterpart, which is accomplished by assuming the indeterminate data set is in the form of boxes, intervals, box-intervals, ellipses, or polyhedra. In this study, the robust counterpart is characterized by a box-interval uncertainty set. Robust counterpart formulation is also associated with master and subproblems. Robust Benders decomposition is applied to address problems with convex goals and quasiconvex constraints in robust optimization. For all data parameters, this method is used to determine the best resilient solution in the feasible region. A manual example of this problem's calculation is provided, and the process is continued using production and operations management–quantitative methods (POM-QM) software.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2022-08-19</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v11i5.4394</dc:identifier><dc:identifier>10.11591/eei.v11i5.4394</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 11 No 5 (2022); 2949-2957</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/4394/2940</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>