Direct Method for Solving Bilinear Programming Problem
The bilinear programming problem is considered, where a column, which corresponds to one of the variables, is not fixed but can be chosen from a convex set. This problem is known as the Dantzig – Wolfe problem. Earlier, a modified support method was proposed to solve the problem, using the decomposi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Belarusian National Technical University
2021-04-01
|
| Series: | Наука и техника |
| Subjects: | |
| Online Access: | https://sat.bntu.by/jour/article/view/2434 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|