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

feat: Utilise constant parameters in aggregated node LP creation. #217

Merged
merged 5 commits into from
Jul 26, 2024

Conversation

jetuk
Copy link
Member

@jetuk jetuk commented Jul 15, 2024

Where possible utilise constant parameters to try to get aggregated node factor pairs during LP creation. This makes it possible to support constant factors in LP solvers without an API for updating the constraint matrix. It should also be generally more efficient by only updating non-constant factors.

Where possible utilise constant parameters to try to get aggregated
node factor pairs during LP creation. This makes it possible to
support constant factors in LP solvers without an API for updating
the constraint matrix. It should also be generally more efficient
by only updating non-constant factors.
@jetuk jetuk requested a review from Batch21 July 15, 2024 19:17
.collect::<Vec<_>>()
} else {
// All factors are available; therefore we can calculate "f0"
// TODO do we need to assert that each individual factor is positive?
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

to do in this PR? Should it be a general requirement that factors are non-negative checked in the schema?

Copy link
Member Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This has been done.

@jetuk jetuk merged commit 67a59e5 into main Jul 26, 2024
6 of 7 checks passed
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