Branch-and-bound decomposition approach for solving quasiconvex-concave programs

1994 ◽  
Vol 82 (2) ◽  
pp. 267-293 ◽  
Author(s):  
R. Horst ◽  
L. D. Muu ◽  
M. Nast
Keyword(s):  
Branch And Bound ◽  
Decomposition Approach ◽  
Concave Programs

scholarly journals A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem

OR Spectrum ◽  
2021 ◽  
Author(s):  
Sophie N. Parragh ◽  
Fabien Tricoire ◽  
Walter J. Gutjahr
Keyword(s):  
Facility Location ◽  
Branch And Bound ◽  
Location Problem ◽  
Optimization Problems ◽  
Facility Location Problem ◽  
Public Facility ◽  
Integer Optimization ◽  
Decomposition Approach ◽  
Deterministic Equivalent ◽  
Cut Generation

AbstractIn many real-world optimization problems, more than one objective plays a role and input parameters are subject to uncertainty. In this paper, motivated by applications in disaster relief and public facility location, we model and solve a bi-objective stochastic facility location problem. The considered objectives are cost and covered demand, where the demand at the different population centers is uncertain but its probability distribution is known. The latter information is used to produce a set of scenarios. In order to solve the underlying optimization problem, we apply a Benders’ type decomposition approach which is known as the L-shaped method for stochastic programming and we embed it into a recently developed branch-and-bound framework for bi-objective integer optimization. We analyze and compare different cut generation schemes and we show how they affect lower bound set computations, so as to identify the best performing approach. Finally, we compare the branch-and-Benders-cut approach to a straight-forward branch-and-bound implementation based on the deterministic equivalent formulation.

PENJADWALAN OPTIMAL TIPE PRODUKSI FLOWSHOP DUA TAHAP MENGGUNAKAN METODE BRANCH AND BOUND DENGAN MEMPERHATIKAN WAKTU TRANSPORTASI

2017 ◽  
Vol 2 (1) ◽  
pp. 1-8
Author(s):  
Marie Muhammad ◽  
Elis Ratna Wulan
Keyword(s):  
Branch And Bound

Penjadwalan produksi dapat dibagi menjadi dua jenis, yaitu penjadwalan produksi tipe jobshop dan penjadwalan produksi tipe flowshop. Penjadwalan produksi tipe flowshop adalah sebuah penjadwalan sebuah produk yang sedemikian rupa sehingga setiap produk diproduksi melalui mesin yang sama dengan alur produksi yang sama. Terdapat beberapa masalah flowshop, salah satunya adalah dengan memperhatikan waktu transportasi. Dan metode Branch and Bound adalah solusi yang tepat untuk memecahkan masalah penjadwalan produksi dengan memperhatikan waktu transportasi untuk meminimalisir waktu yang terlewati. Pada penulisan Studi Literatur ini, Penjadwalan optimal dari 4 buah job dan 2 buah mesin dengan memperhatikan waktu transportasi adalah 1, 2, 4, dan 3 dengan waktu yang terlewati adalah 59 unit satuan waktu.

Parametrical Synthesis of Linear Controllers in Aperiodical Systems on Basis of Decomposition Approach

2019 ◽  
Vol 12 (4) ◽  
pp. 192
Author(s):  
Sergey Anatolevich Gayvoronskiy ◽  
Tatiana Ezangina ◽  
Maxim Pushkarev ◽  
Ivan Khozhaev
Keyword(s):  
Decomposition Approach ◽  
Linear Controllers
Sign in / Sign up

Export Citation Format

Share Document