| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
|
mkagenius
|
15 years ago,
show (+1)
#
|
|
mkagenius
|
15 years ago,
hide
#
|
0
Can this be used to find the highest point of the lowest envelope?
(i will use it in graphical method to solve two-person-zero-sum game (2Xn matrix) ) If yes , then plz tell how ? (if you have free time :) )
→
Reply
|
|
MarioYC
|
15 years ago,
show
#
|
|
MarioYC
|
15 years ago,
hide
#
^
|
0
Hi, I haven't finished reading it, but decided to share it, since I haven't heard about it before. Now, about the highest I think it wouldn't be hard to find if you have the lines which form the segments that form the lowest envelope, as far as I understand the method gives you that. :)
→
Reply
|
| Name |
|---|


