Skip to main content
10 events
when toggle format what by license comment
Jan 6, 2021 at 5:35 answer added Max Alekseyev timeline score: 1
Jan 6, 2021 at 1:43 comment added RobPratt The disjunctive normal form approach will almost certainly be much slower than solving the mixed integer linear programming formulation in my linked answer.
Jan 5, 2021 at 22:26 comment added J.J. Green .. and yes, solve each subproblem, take the smallest of the solutions
Jan 5, 2021 at 22:24 comment added J.J. Green Sorry, that should be Motzkin.
Jan 5, 2021 at 22:21 comment added Eric_ @J.J.Green This is an interesting approach. Just to make sure, my problem can be written as a conjunctive normal form (AND among all the equations-couples, and in each couple an OR statement), and by writing it as a disjunctive normal form, I get multiple sets of equations, and each solution will fit to my problem, so I will take the minimal (assuming I want to min in my LP) one, yes? Also, I have searched for "Fourier-Moskowitz", but found no results. Is this a software?
Jan 5, 2021 at 22:12 comment added J.J. Green If you think of your inequalities as just being statements, then arbitrary ANDs and ORs of those can be reduced to disjunctive normal form (an OR of AND expressions). These AND expressions are linear programs sovable by Fourier-Moskowitz etc, and correspond (as @LSpice mentioned) convex bodies. The problem is that there may be many of them, you can get an "exponential explosion" in the number of sub-programs.
Jan 5, 2021 at 22:09 comment added RobPratt Cross-posted: math.stackexchange.com/questions/3974002/…
Jan 5, 2021 at 22:06 comment added LSpice The solution set of a system of linear inequalities is convex, but the solution set of a system involving ‘or’ usually will not be.
Jan 5, 2021 at 21:42 review First posts
Jan 6, 2021 at 1:07
Jan 5, 2021 at 21:36 history asked Eric_ CC BY-SA 4.0