Coding Nested Optimization Loops and Strong Duality Theory
7 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaires
Réponses (0)
Voir également
Catégories
En savoir plus sur Get Started with Optimization Toolbox dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!