Hi,
If we want to linearize and minimize an absolute term like |A-B|, where A and B are free integer variables. How do I do it?
Also, if the term changed to |A-1| what is the linear model for that?
I have solved the second part:
A-1<= x
1-A>=x
X>=0,
Min x
Is this correct?.
Search found 3 matches
- 4 years ago
- Forum: Modeling
- Topic: Linearizing and minimizing an absolute term
- Replies: 1
- Views: 1725
- 4 years ago
- Forum: Modeling
- Topic: Nonlinear constraints in MINLP model
- Replies: 1
- Views: 2048
Re: Nonlinear constraints in MINLP model
For linearizing the nonlinear equations, you can use piecewise modulation. Others, like you are getting an infeasible solution, try to check the boundaries of your variables. Your solution might be out of the feasible region.
- 4 years ago
- Forum: Modeling
- Topic: Modeling the absolute value
- Replies: 23
- Views: 21395
Re: Modeling the absolute value
Does someone know how to linearize and optimize this absolute term |A - B|, where both A and B are free integers. And what if the term changed to |A-1|, what will the minimization look like?.
Here is my Linearization for |A-1|
X>=A-1
X>=1-A
X>=0.
Min X
Is this correct?
Here is my Linearization for |A-1|
X>=A-1
X>=1-A
X>=0.
Min X
Is this correct?