Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Dsda_changes #29

Merged
merged 4 commits into from
Nov 19, 2024
Merged

Dsda_changes #29

merged 4 commits into from
Nov 19, 2024

Conversation

AlbertLee125
Copy link

Modified _solve_GDP_subproblem
The _solve_GDP_subproblem function solves GDP subproblems by fixing disjunctions based on external variable values. It was modified to return None along with False in cases of infeasibility, allowing it to integrate smoothly with the neighbor search process.

Parameters:

external_var_value: List of external variable values.
search_type: Type of search (e.g., "Neighbor search").
config: GDPopt configuration block.

Returns:

True/False: Indicates if the primal bound is improved.
None: Returned when infeasibility occurs.

Neighbor Search
The neighbor_search function evaluates neighboring points and selects the best one, considering both objective improvement and distance (tiebreaker). If multiple neighbors have similar primal bounds, the one farther from the current point is chosen.

I hope this is compatible this time.

@ZedongPeng ZedongPeng merged commit 4bd41ef into ZedongPeng:dsda_dev Nov 19, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants