I'm trying to linearize the constraint:

sum {i in I} x_ijk*b_i >= d_j,k, for j in J and k in K.

with x and b are binary and d integers (like demands). Can someone please help me? I have already tried use the topic linearizations (replace x*b by x+b-1), but the problem happen when x and b are both 0.

Thanks and Happy New Year to everyone!

asked 31 Dec '16, 15:13

Paulo's gravatar image

accept rate: 0%

edited 31 Dec '16, 15:14


This is a FAQ. Have you tried using the search bar? (Suggested terms: "binary" and "product" or "quadratic".)

(31 Dec '16, 17:06) Paul Rubin ♦♦
Be the first one to answer this question!
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "Title")
  • image?![alt text](/path/img.jpg "Title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported



Asked: 31 Dec '16, 15:13

Seen: 1,626 times

Last updated: 31 Dec '16, 17:06

OR-Exchange! Your site for questions, answers, and announcements about operations research.