Microsoft.SolverFoundation linear programming
0
I cannot solve integer linear programming with variable numbers up to thousands and number constraints up hundreds by Microsoft.SolverFoundation, it solves very slow. Please give me advice on which library to use to speed up, I need it within 15 seconds. Thank you.
public void Calculate()
{
Services.SolverContext solver = Services.SolverContext.GetContext();
solver.ClearModel();
Services.Model model = solver.CreateModel();
List<Services.Decision> decisions = new List<Services.Decision>();
for (int i = 0; i < NumChoices.Count; i++)
{
var decision = new Services.Decision(Services.Domain.IntegerNonnegative, $"x{i}");
model.AddDecision(decision);
decisions.Add(decision);
}
for (int j = 0; j < NumChoices[0].Count; j++)
{
Services.Term target = null;
for (int i = 0; i < decisions.Count; i++)
{
if (i == 0)
{
target = decisions[i] * NumChoices[i][j];
}
else
{
target += decisions[i] * NumChoices[i][j];
}
}
if (j == 0)
{
model.AddGoal("Goal", Services.GoalKind.Minimize, target);
}
else
{
target = (QuantityRebars[j] == target);
model.AddConstraint($"Constraint{j}", target);
}
}
Services.Solution solution = solver.Solve();
for (int i = 0; i < decisions.Count; i++)
{
Results.Add(Math.Round(decisions[i].GetDouble()));
TotalBarLength += Math.Round(decisions[i].GetDouble()) * StandandBarLength;
Waste += NumChoices[i][0] * Math.Round(decisions[i].GetDouble());
}
Used = TotalBarLength - Waste;
}
msf
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
add a comment |
0
I cannot solve integer linear programming with variable numbers up to thousands and number constraints up hundreds by Microsoft.SolverFoundation, it solves very slow. Please give me advice on which library to use to speed up, I need it within 15 seconds. Thank you.
public void Calculate()
{
Services.SolverContext solver = Services.SolverContext.GetContext();
solver.ClearModel();
Services.Model model = solver.CreateModel();
List<Services.Decision> decisions = new List<Services.Decision>();
for (int i = 0; i < NumChoices.Count; i++)
{
var decision = new Services.Decision(Services.Domain.IntegerNonnegative, $"x{i}");
model.AddDecision(decision);
decisions.Add(decision);
}
for (int j = 0; j < NumChoices[0].Count; j++)
{
Services.Term target = null;
for (int i = 0; i < decisions.Count; i++)
{
if (i == 0)
{
target = decisions[i] * NumChoices[i][j];
}
else
{
target += decisions[i] * NumChoices[i][j];
}
}
if (j == 0)
{
model.AddGoal("Goal", Services.GoalKind.Minimize, target);
}
else
{
target = (QuantityRebars[j] == target);
model.AddConstraint($"Constraint{j}", target);
}
}
Services.Solution solution = solver.Solve();
for (int i = 0; i < decisions.Count; i++)
{
Results.Add(Math.Round(decisions[i].GetDouble()));
TotalBarLength += Math.Round(decisions[i].GetDouble()) * StandandBarLength;
Waste += NumChoices[i][0] * Math.Round(decisions[i].GetDouble());
}
Used = TotalBarLength - Waste;
}
msf
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
add a comment |
0
0
0
I cannot solve integer linear programming with variable numbers up to thousands and number constraints up hundreds by Microsoft.SolverFoundation, it solves very slow. Please give me advice on which library to use to speed up, I need it within 15 seconds. Thank you.
public void Calculate()
{
Services.SolverContext solver = Services.SolverContext.GetContext();
solver.ClearModel();
Services.Model model = solver.CreateModel();
List<Services.Decision> decisions = new List<Services.Decision>();
for (int i = 0; i < NumChoices.Count; i++)
{
var decision = new Services.Decision(Services.Domain.IntegerNonnegative, $"x{i}");
model.AddDecision(decision);
decisions.Add(decision);
}
for (int j = 0; j < NumChoices[0].Count; j++)
{
Services.Term target = null;
for (int i = 0; i < decisions.Count; i++)
{
if (i == 0)
{
target = decisions[i] * NumChoices[i][j];
}
else
{
target += decisions[i] * NumChoices[i][j];
}
}
if (j == 0)
{
model.AddGoal("Goal", Services.GoalKind.Minimize, target);
}
else
{
target = (QuantityRebars[j] == target);
model.AddConstraint($"Constraint{j}", target);
}
}
Services.Solution solution = solver.Solve();
for (int i = 0; i < decisions.Count; i++)
{
Results.Add(Math.Round(decisions[i].GetDouble()));
TotalBarLength += Math.Round(decisions[i].GetDouble()) * StandandBarLength;
Waste += NumChoices[i][0] * Math.Round(decisions[i].GetDouble());
}
Used = TotalBarLength - Waste;
}
msf
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
I cannot solve integer linear programming with variable numbers up to thousands and number constraints up hundreds by Microsoft.SolverFoundation, it solves very slow. Please give me advice on which library to use to speed up, I need it within 15 seconds. Thank you.
public void Calculate()
{
Services.SolverContext solver = Services.SolverContext.GetContext();
solver.ClearModel();
Services.Model model = solver.CreateModel();
List<Services.Decision> decisions = new List<Services.Decision>();
for (int i = 0; i < NumChoices.Count; i++)
{
var decision = new Services.Decision(Services.Domain.IntegerNonnegative, $"x{i}");
model.AddDecision(decision);
decisions.Add(decision);
}
for (int j = 0; j < NumChoices[0].Count; j++)
{
Services.Term target = null;
for (int i = 0; i < decisions.Count; i++)
{
if (i == 0)
{
target = decisions[i] * NumChoices[i][j];
}
else
{
target += decisions[i] * NumChoices[i][j];
}
}
if (j == 0)
{
model.AddGoal("Goal", Services.GoalKind.Minimize, target);
}
else
{
target = (QuantityRebars[j] == target);
model.AddConstraint($"Constraint{j}", target);
}
}
Services.Solution solution = solver.Solve();
for (int i = 0; i < decisions.Count; i++)
{
Results.Add(Math.Round(decisions[i].GetDouble()));
TotalBarLength += Math.Round(decisions[i].GetDouble()) * StandandBarLength;
Waste += NumChoices[i][0] * Math.Round(decisions[i].GetDouble());
}
Used = TotalBarLength - Waste;
}
msf
msf
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
asked Dec 31 '18 at 6:58
QuangNhuQuangNhu
11
11
add a comment |
add a comment |
0
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',
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53984533%2fmicrosoft-solverfoundation-linear-programming%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 Stack Overflow!
- 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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53984533%2fmicrosoft-solverfoundation-linear-programming%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
