Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
For questions related to the simplex method for linear programming (LP), which solves LPs optimally by moving iteratively from in corner point of the feasible region to a better one.
0
votes
0
answers
72
views
Simplex algorithm for stochastic constraints?
Does this mean that simplex solvers would be able to accept constraints such as the below
$$ \operatorname{Prob}(a_1x + a_2y >=3) \geq 0.95 $$
either directly or with some reformulation? …
2
votes
2
answers
603
views
Simplex method for multiple objectives
I am a user of Google OR Tools, which can interface with many LP & MIP solvers, plus it's own SAT based constraint programming solver.
My question, in the context of OR-Tools, is: how should I best ha …