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.

Sign up for GitHub

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

Jump to bottom

24-02 Examples of integer programs · 모두를 위한 컨벡스 최적화 #205

Open
utterances-bot opened this issue Nov 16, 2022 · 3 comments
Open

24-02 Examples of integer programs · 모두를 위한 컨벡스 최적화 #205

utterances-bot opened this issue Nov 16, 2022 · 3 comments

Comments

@utterances-bot
Copy link

24-02 Examples of integer programs · 모두를 위한 컨벡스 최적화

https://convex-optimization-for-all.github.io/contents/chapter24/2021/03/28/24_02_Example_of_integer_programs/
@jpark3141 utterances
Copy link

Assignment problem의 세 번째 수식에서 sum의 index가 i가아닌 j로 바뀌어야 하고 j=1,…,n 부분은 i=1,…,n으로 바뀌어야 할 것 같습니다.

@adover134 utterances
Copy link

adover134 commented Feb 8, 2023 •
edited
Loading

Facility location problem에서 수식의 제약조건들은 모두 i가 m까지인 것으로 범위를 바꿔줘야 합니다.

@Curt-Park
Copy link
Collaborator

@jpark3141 @adover134 수정하겠습니다.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@Curt-Park @jpark3141 @utterances-bot @adover134