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 | |
Results tagged with linear-programming
Search options answers only
not deleted
user 198
Optimization with a linear objective function, subject to linear equality and linear inequality constraints.
4
votes
Linear Programming: algorithm to check if ratios can be combined with n bottles to equal a g...
I don't know what class this is for, and how much linear programming you are learning in it, so I don't really know what you need.
One way to do it: assuming $a_i + b_i + c_i = 1, \ \forall i$, use …
- 4,490
6
votes
A variant of the Assignment Problem
This can be formulated as an instance of min-cost (or in this case, max-profit) flow.
Set up a network as follows. There will be four layers.
The first layer is a single node we call the source. The …
- 4,490