Given one constraint with integer coefficient and binary variables \(a^T*x =b\) with \(a_i, b \in \mathbb{N}\) and \(x_i\) binary.

How can i write a system of constraints \(A*x=c\), which has the same solutions, but \(A\) and \(c\) only contains elements in \(\{0,1\}\).

asked 07 Feb '18, 18:17

opt3's gravatar image

accept rate: 0%

edited 07 Feb '18, 18:29

Paul%20Rubin's gravatar image

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]( "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: 07 Feb '18, 18:17

Seen: 319 times

Last updated: 07 Feb '18, 18:29

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