integer-programming

I have an optimization problem that has in the objective function 2 multiplied variables, making the model quadratic. I am currently using zimpl, to parse the model, and glpk to solve it. As they don't support quadratic programming, I would need to convert this to an MILP. . The first variable is real, in range [0, 1], the second one is real, from range 0 to inf. This one could without a problem be integer. The critical part in the objective function looks like this: max ... + var1 * var2 + ... I had similar problems in the constraints, but they were easily solvable. How could I solve this

I'm trying to solve integer programming problems. I've tried both use SCIP and LPSolve For example, given the final values of A and B, I want to solve for valA in the following C# code: Int32 a = 0, b = 0; a = a*-6 + b + 0x74FA - valA; b = b/3 + a + 0x81BE - valA; a = a*-6 + b + 0x74FA - valA; b = b/3 + a + 0x81BE - valA; // a == -86561, b == -32299 Which I implemented as this integer program in lp format (the truncating division causes a few complications): min: ; +valA >= 0; +valA < 92; remAA_sign >= 0; remAA_sign <= 1; remAA <= 2; remAA >= -2; remAA +2 remAA_sign >= 0; remAA +2 remAA_sign <

I have a set of metallic sliding pieces which are constrained to the x and y axis in following way: I would need to maximize the horizontal distance among all pieces constrained by the same slider and the vertical distance among the sliding pieces and the sliders itself. How can this be solved? Any advice and suggestion which can lead to a solution for this problem would be greatly appreciated. I looked first at some very powerful libraries like cassowary and jsLPSolver but i had some trouble to understand the core algorithm and how the constraint are checked for feasibility and how the