Timeline for How hard is a linear programming with a bounded constraint?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 8, 2021 at 12:27 | comment | added | Inner_peace | @DimaPasechnik Thanks for your explanation! You give a more general statement of this problem. | |
| Jul 8, 2021 at 11:40 | comment | added | Dima Pasechnik | as you can multiply variables by arbitrary positive numbers, what you ask is whether having in $A$ a row with positive entries might give you a faster algorithm. Even more generally, as you can replace rows of $A$ by arbitrary linear combinations, you ask whether the property of $A$ to have an all-positive linear combination of rows might lead to a faster algorithm. | |
| Jul 8, 2021 at 2:50 | comment | added | Inner_peace | Thanks for your answer. I agree that this form with the extra constraint can be reduced to the standard form. How about the inverse? If there is no reduction for the inverse, then it means there could be some easier method than linear programming. | |
| Jul 5, 2021 at 5:23 | history | answered | RobPratt | CC BY-SA 4.0 |