Coding Nested Optimization Loops and Strong Duality Theory
8 ビュー (過去 30 日間)
古いコメントを表示
Hi all,
I am currently a graduate student starting on a new project with relatively little experience in using MATLAB. Recently, I have converted a nested bi-level optimization problem into a single level problem using the strong duality theory. From my current resources, I am using GLPK as the MILP solver.
One problem I am currently having is that I am having a difficult time trying to set up my A, Aeq, b and beq matrices due to some non-linear constraints. For example:
v <= y*vmax, where y is a binary variable, vmax is a constant and v is a continuous variable.
Based on the current MATLAB documentation, it would seem that the y variable will need to be placed in the beq matrix.
If possible, I was wondering if I can get some advice to this matter.
Best and God Bless,
Eugene
0 件のコメント
回答 (0 件)
参考
カテゴリ
Help Center および File Exchange で Get Started with Optimization Toolbox についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!