Timeline for Prove a feasible point is optimal for an LP using complementary slackness
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 2, 2022 at 9:15 | history | edited | Johnnuy junk | CC BY-SA 4.0 | edited body |
| Jan 2, 2022 at 8:59 | vote | accept | Johnnuy junk | ||
| Jan 1, 2022 at 12:54 | history | edited | Jose Avilez | CC BY-SA 4.0 | edited title |
| Jan 1, 2022 at 10:11 | answer | added | callculus42 | timeline score: 2 | |
| Jan 1, 2022 at 5:57 | history | edited | RobPratt | CC BY-SA 4.0 | deleted 1 character in body |
| Jan 1, 2022 at 5:46 | history | edited | RobPratt | CC BY-SA 4.0 | added 15 characters in body |
| Jan 1, 2022 at 5:18 | comment | added | Johnnuy junk | Thanks i edited the question | |
| Jan 1, 2022 at 5:18 | history | edited | Johnnuy junk | CC BY-SA 4.0 | edited body |
| Jan 1, 2022 at 3:30 | comment | added | RobPratt | Setting $t_1=0$ yields $7y_1+2y_2=2$. | |
| Jan 1, 2022 at 0:56 | comment | added | Brian Borchers | Note that you should check that $x=(2,0,0)$ is primal feasible. $y$ must also satisfy the dual constraints. If you can find any vector $y$ with $7y_{1}-3y_{2}=0$ that also satisfies the other dual constraints then you will have shown that $x=(2,0,0)$ is optimal. There's no reason to expect the optimal dual solution $y$ to be unique. | |
| Jan 1, 2022 at 0:16 | history | edited | Johnnuy junk | CC BY-SA 4.0 | added 6 characters in body |
| Jan 1, 2022 at 0:10 | history | asked | Johnnuy junk | CC BY-SA 4.0 |