# integer coefficients reformulation

 0 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 61●5 accept rate: 0% Paul Rubin ♦♦ 14.6k●5●13
Be the first one to answer this question!
 toggle preview community wiki

### Follow this question

By Email:

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

By RSS:

Answers

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

Tags:

Asked: 07 Feb '18, 18:17

Seen: 319 times

Last updated: 07 Feb '18, 18:29

### Related questions

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