A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination
A disjointly constrained bilinear program (DBLP) has various practical and industrial applications, e.g., in game theory, facility location, supply chain management, and multi-agent planning problems. Although earlier work has noted the equivalence of DBLP and mixed-integer linear programming (MILP)...
محفوظ في:
المؤلفون الرئيسيون: | JEONG, Jihwan, SANNER, Scott, KUMAR, Akshat |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2023
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/8090 https://ink.library.smu.edu.sg/context/sis_research/article/9093/viewcontent/978_3_031_33271_5_6_pv.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
An algorithm for solving a class of bilinear integer programming problem
بواسطة: Tran, Xuan Sinh
منشور في: (2017) -
Piecewise linear relaxation of bilinear programs using bivariate partitioning
بواسطة: Hasan, M.M.F., وآخرون
منشور في: (2014) -
Piecewise MILP under- and overestimators for global optimization of bilinear programs
بواسطة: Wicaksono, D.S., وآخرون
منشور في: (2014) -
Enhancing bilinear subspace learning by element rearrangement
بواسطة: Xu, D., وآخرون
منشور في: (2014) -
A heuristic approach to solving a class of bilinear matrix inequality problems
بواسطة: Zheng, F., وآخرون
منشور في: (2014)