Coding Nested Optimization Loops and Strong Duality Theory
조회 수: 6 (최근 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!