Constraint satisfaction problem (CSP) for inequalities of vectors












2














I have two vectors $Y= (y_1, y_2, ldots, y_m)^T$ and $S= (s_1, s_2,ldots, s_m)^T$, where all entries in $Y$ and $S$ being positive integers. $Y$ is defined by $Y = A + B cdot X$, where $A$ is a constant $m$-vector, $B$ is a constant $m times n$ matrix and $X$ is a variable $n$-vector.



Given $S$, I want to find all the possible values of $X = (x_1, x_2, ldots, x_n)^T$ such that $Y neq S$ using linear integer programming.



I thought of using the following constraint satisfaction problem (CSP) by adding the variable $z_j$ such that $z_j = |y_j - s_j|$ to check that at least for one entry $j$ we have $y_j neq s_j$:



$$Y = A + B cdot X geqslant vec{0},\
z_j = |y_j - s_j|,quad forall j in 1, cdots, m\
sum_{j=1}^{m} z_j geq 1.$$



But I have a problem with the absolute value. What should I do to achieve this?










share|cite|improve this question
























  • look up how to model piecewise linear functions by using binary variables
    – LinAlg
    Nov 28 '18 at 13:11










  • @LinAlg thank you for this answer. I am new to this field can you please give me more hints.
    – I.Saadaoui
    Nov 28 '18 at 14:10










  • section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
    – LinAlg
    Nov 28 '18 at 14:31
















2














I have two vectors $Y= (y_1, y_2, ldots, y_m)^T$ and $S= (s_1, s_2,ldots, s_m)^T$, where all entries in $Y$ and $S$ being positive integers. $Y$ is defined by $Y = A + B cdot X$, where $A$ is a constant $m$-vector, $B$ is a constant $m times n$ matrix and $X$ is a variable $n$-vector.



Given $S$, I want to find all the possible values of $X = (x_1, x_2, ldots, x_n)^T$ such that $Y neq S$ using linear integer programming.



I thought of using the following constraint satisfaction problem (CSP) by adding the variable $z_j$ such that $z_j = |y_j - s_j|$ to check that at least for one entry $j$ we have $y_j neq s_j$:



$$Y = A + B cdot X geqslant vec{0},\
z_j = |y_j - s_j|,quad forall j in 1, cdots, m\
sum_{j=1}^{m} z_j geq 1.$$



But I have a problem with the absolute value. What should I do to achieve this?










share|cite|improve this question
























  • look up how to model piecewise linear functions by using binary variables
    – LinAlg
    Nov 28 '18 at 13:11










  • @LinAlg thank you for this answer. I am new to this field can you please give me more hints.
    – I.Saadaoui
    Nov 28 '18 at 14:10










  • section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
    – LinAlg
    Nov 28 '18 at 14:31














2












2








2







I have two vectors $Y= (y_1, y_2, ldots, y_m)^T$ and $S= (s_1, s_2,ldots, s_m)^T$, where all entries in $Y$ and $S$ being positive integers. $Y$ is defined by $Y = A + B cdot X$, where $A$ is a constant $m$-vector, $B$ is a constant $m times n$ matrix and $X$ is a variable $n$-vector.



Given $S$, I want to find all the possible values of $X = (x_1, x_2, ldots, x_n)^T$ such that $Y neq S$ using linear integer programming.



I thought of using the following constraint satisfaction problem (CSP) by adding the variable $z_j$ such that $z_j = |y_j - s_j|$ to check that at least for one entry $j$ we have $y_j neq s_j$:



$$Y = A + B cdot X geqslant vec{0},\
z_j = |y_j - s_j|,quad forall j in 1, cdots, m\
sum_{j=1}^{m} z_j geq 1.$$



But I have a problem with the absolute value. What should I do to achieve this?










share|cite|improve this question















I have two vectors $Y= (y_1, y_2, ldots, y_m)^T$ and $S= (s_1, s_2,ldots, s_m)^T$, where all entries in $Y$ and $S$ being positive integers. $Y$ is defined by $Y = A + B cdot X$, where $A$ is a constant $m$-vector, $B$ is a constant $m times n$ matrix and $X$ is a variable $n$-vector.



Given $S$, I want to find all the possible values of $X = (x_1, x_2, ldots, x_n)^T$ such that $Y neq S$ using linear integer programming.



I thought of using the following constraint satisfaction problem (CSP) by adding the variable $z_j$ such that $z_j = |y_j - s_j|$ to check that at least for one entry $j$ we have $y_j neq s_j$:



$$Y = A + B cdot X geqslant vec{0},\
z_j = |y_j - s_j|,quad forall j in 1, cdots, m\
sum_{j=1}^{m} z_j geq 1.$$



But I have a problem with the absolute value. What should I do to achieve this?







linear-algebra linear-programming integer-programming constraint-programming






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 28 '18 at 5:07









Saad

19.7k92352




19.7k92352










asked Nov 28 '18 at 4:45









I.Saadaoui

113




113












  • look up how to model piecewise linear functions by using binary variables
    – LinAlg
    Nov 28 '18 at 13:11










  • @LinAlg thank you for this answer. I am new to this field can you please give me more hints.
    – I.Saadaoui
    Nov 28 '18 at 14:10










  • section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
    – LinAlg
    Nov 28 '18 at 14:31


















  • look up how to model piecewise linear functions by using binary variables
    – LinAlg
    Nov 28 '18 at 13:11










  • @LinAlg thank you for this answer. I am new to this field can you please give me more hints.
    – I.Saadaoui
    Nov 28 '18 at 14:10










  • section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
    – LinAlg
    Nov 28 '18 at 14:31
















look up how to model piecewise linear functions by using binary variables
– LinAlg
Nov 28 '18 at 13:11




look up how to model piecewise linear functions by using binary variables
– LinAlg
Nov 28 '18 at 13:11












@LinAlg thank you for this answer. I am new to this field can you please give me more hints.
– I.Saadaoui
Nov 28 '18 at 14:10




@LinAlg thank you for this answer. I am new to this field can you please give me more hints.
– I.Saadaoui
Nov 28 '18 at 14:10












section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
– LinAlg
Nov 28 '18 at 14:31




section 7.6 of download.aimms.com/aimms/download/manuals/AIMMS3_OM.pdf
– LinAlg
Nov 28 '18 at 14:31










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3016726%2fconstraint-satisfaction-problem-csp-for-inequalities-of-vectors%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3016726%2fconstraint-satisfaction-problem-csp-for-inequalities-of-vectors%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Quarter-circle Tiles

build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

Mont Emei