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

Convergence rate dependent on constants in objective function. #4

Open
2 tasks done
1ozturkbe opened this issue Feb 23, 2018 · 2 comments
Open
2 tasks done

Convergence rate dependent on constants in objective function. #4

1ozturkbe opened this issue Feb 23, 2018 · 2 comments

Comments

@1ozturkbe
Copy link
Contributor

1ozturkbe commented Feb 23, 2018

As of commit 1bc2440, we can 'kind of' get the correct connectivity. However, the reltol has an effect on the convergence rate, as well as the magnitude of the penalty on the slack. I need to implement a way to normalize slack penalty.
Ideas:

  • normalize by maximum flow cost among all edges times number of edges
  • total cost is the sum(edgeCost*flow) * prod(slack).
    To be brainstormed...
@1ozturkbe
Copy link
Contributor Author

1ozturkbe commented Feb 23, 2018

ITEM: total cost is the sum(edgeCost * flow) * prod(slack)
COMMENTS: Doesn't work. Slacks blow up so that edgeCost*flow goes to zero in the case when the self-flow has no cost.

@1ozturkbe
Copy link
Contributor Author

ITEM: normalize by maximum flow cost among all edges times number of edges
COMMENTS: Doesn't work. Same as above (should have known...)

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

No branches or pull requests

1 participant