-
Notifications
You must be signed in to change notification settings - Fork 526
New issue
Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? # to your account
Add Logic-Based Discrete-Steepest Descent Algorithm in GDPOpt #3331
base: main
Are you sure you want to change the base?
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #3331 +/- ##
==========================================
- Coverage 88.50% 88.37% -0.13%
==========================================
Files 868 869 +1
Lines 98418 98614 +196
==========================================
+ Hits 87100 87154 +54
- Misses 11318 11460 +142
Flags with carried forward coverage won't be shown. Click here to find out more. ☔ View full report in Codecov by Sentry. |
I will add tests to increase the code coverage. |
Hi @dovallev and @David-Linan, This PR includes a general implementation of |
@ZedongPeng is this ready for review now? |
Dsda_changes
@ZedongPeng could you please run |
Hi @blnicho and @jsiirola . Do you know how to resolve the following 'gams' not found issue?
|
Yup: use |
Hi @ZedongPeng, it also looks like the Jenkins failures are real. Here's the stack trace:
|
The error in Jenkins is related to a lack of initialization of the variables after the discretization. There is a related bug report in issue #3101 |
Summary/Motivation:
This PR introduces the implementation of the Logic-Based Discrete Steepest Descent algorithm in GDPOpt.
The Logic-based Discrete-Steepest Descent Algorithm (LD-SDA) is a solution method for GDP problems involving ordered Boolean variables. The LD-SDA reformulates these ordered Boolean variables into integer decisions called external variables. The LD-SDA solves the reformulated GDP problem using a two-level decomposition approach where the upper-level subproblem determines external variable configurations. Subsequently, the remaining continuous and discrete variables are solved as a subproblem only involving those constraints relevant to the given external variable arrangement, effectively taking advantage of the structure of the GDP problem.
More details in the paper https://arxiv.org/abs/2405.05358 .
@emma58 @bernalde
Legal Acknowledgement
By contributing to this software project, I have read the contribution guide and agree to the following terms and conditions for my contribution: