Cplex in java: constraint depends on the objective array











up vote
0
down vote

favorite












I am new to learn cplex in java. As I was trying to solve a special case in which the constraint needs calculation by the IloNumVar array, I met the trouble about how add this calculation into cplex.



The model is
get a matrix m[i][j], for example a 3*3 matrix:
1 2 3
2 1 2
3 2 1
objective: min sum(a[i]) i = {1 ... n}
s.t. a[i] = 0 or 1
b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1
b[i] <= 2

Is there a way to add this b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1 into cplex java code? Thanks a lot.






java cplex







share|improve this question







New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
    – TimChippingtonDerrick
    11 hours ago















up vote
0
down vote

favorite












I am new to learn cplex in java. As I was trying to solve a special case in which the constraint needs calculation by the IloNumVar array, I met the trouble about how add this calculation into cplex.



The model is
get a matrix m[i][j], for example a 3*3 matrix:
1 2 3
2 1 2
3 2 1
objective: min sum(a[i]) i = {1 ... n}
s.t. a[i] = 0 or 1
b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1
b[i] <= 2

Is there a way to add this b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1 into cplex java code? Thanks a lot.






java cplex







share|improve this question







New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
    – TimChippingtonDerrick
    11 hours ago













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am new to learn cplex in java. As I was trying to solve a special case in which the constraint needs calculation by the IloNumVar array, I met the trouble about how add this calculation into cplex.



The model is
get a matrix m[i][j], for example a 3*3 matrix:
1 2 3
2 1 2
3 2 1
objective: min sum(a[i]) i = {1 ... n}
s.t. a[i] = 0 or 1
b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1
b[i] <= 2

Is there a way to add this b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1 into cplex java code? Thanks a lot.






java cplex







share|improve this question







New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I am new to learn cplex in java. As I was trying to solve a special case in which the constraint needs calculation by the IloNumVar array, I met the trouble about how add this calculation into cplex.



The model is
get a matrix m[i][j], for example a 3*3 matrix:
1 2 3
2 1 2
3 2 1
objective: min sum(a[i]) i = {1 ... n}
s.t. a[i] = 0 or 1
b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1
b[i] <= 2

Is there a way to add this b[i] = min (a[i][j]) j = {1 ... n} where a[i] = 1 into cplex java code? Thanks a lot.






java cplex




java cplex






share|improve this question







New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question







New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question






New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked yesterday









Shaw Xia

1




1




New contributor




Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Shaw Xia is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
    – TimChippingtonDerrick
    11 hours ago


















  • Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
    – TimChippingtonDerrick
    11 hours ago
















Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
– TimChippingtonDerrick
11 hours ago




Sorry, but I don't see which are your decision variables, what are the constants? You mention a matrix m, but don't use it? You also use 'a' as a 1-dimensional array in some places and as a 2-dimensional array in others?
– TimChippingtonDerrick
11 hours ago

















active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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',
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});






Shaw Xia is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53349290%2fcplex-in-java-constraint-depends-on-the-objective-array%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes








Shaw Xia is a new contributor. Be nice, and check out our Code of Conduct.










 

draft saved


draft discarded


















Shaw Xia is a new contributor. Be nice, and check out our Code of Conduct.













Shaw Xia is a new contributor. Be nice, and check out our Code of Conduct.












Shaw Xia is a new contributor. Be nice, and check out our Code of Conduct.















 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53349290%2fcplex-in-java-constraint-depends-on-the-objective-array%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

Create new schema in PostgreSQL using DBeaver

Image
0 At the beginning of my current job I had limited access to DB but recently my role is changed to superuser, admin, and owner. My colleague who was the previous DB admin is able to create a schema or change the permissions as there is a permission tab in the properties and he can change permissions by clicking easily. Would you please let me know how I can create schema and change permissions as well? Why his dbeaver looks different from me? He can easily right click on the schema folder on top of all schemas on the left side column and select create new schema while I do not have that, like the following picture I found on the internet. postgresql database-schema dbeaver share | improve this question
Read more

Deepest pit of an array with Javascript: test on Codility

Image
0 $begingroup$ This is the question from a Codility test, as a task in an interview: DeepestPit - problem description A non-empty zero-indexed array A consisting of N integers is given. A pit in this array is any triplet of integers (P, Q, R) such that: ·         0 ≤ P < Q < R < N; ·         sequence [A[P], A[P+1], ..., A[Q]] is strictly decreasing, i.e. A[P] > A[P+1] > ... > A[Q]; ·         sequence A[Q], A[Q+1], ..., A[R] is strictly increasing, i.e. A[Q] < A[Q+1] < ... < A[R]. The depth of a pit (P, Q, R) is the number min {A[P] − A[Q], A[R] − A[Q]}. For example, consider array A consisting of 10 elements such that: A[0] = 0 A[1] = 1 A[2] = 3 A[3] = -2 A[4] = 0 A[5] = 1 A[6] = 0 A[7] = -3 A[8] = 2 A[9] = 3 Triplet (2, 3, 4) is
Read more

Costa Masnaga

Image
.mw-parser-output .avviso .mbox-text-div>div,.mw-parser-output .avviso .mbox-text-full-div>div{font-size:90%}.mw-parser-output .avviso .mbox-image div{width:52px}.mw-parser-output .avviso .mbox-text-full-div .hide-when-compact{display:block} Questa voce o sezione sull'argomento Lombardia non cita le fonti necessarie o quelle presenti sono insufficienti . Puoi migliorare questa voce aggiungendo citazioni da fonti attendibili secondo le linee guida sull'uso delle fonti. Segui i suggerimenti del progetto di riferimento. Costa Masnaga comune Localizzazione Stato   Italia Regione Lombardia Provincia Lecco Amministrazione Sindaco Sabina Panzeri (Al centro il cittadino) dall'08/06/2009 Territorio Coordinate 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Coordinate: 45°46′N 9°17′E  /  45.766667°N 9.283333°E 45.766667; 9.283333  ( Costa Masnaga ) Altitudine 318 m s.l.m
Read more