user avatar
user avatar
user avatar
Johan Löfberg
  • Member for 3 years, 2 months
  • Last seen this week
15 votes

Can an integer optimization problem be convex?

11 votes

How can I model regression with an asymmetric loss function?

8 votes

How to deal with a decision variable in the objective function that depends on if-else conditions involving other decision variables?

8 votes

What does nonconvex multilinear mean?

7 votes

Modeling floor function exactly

6 votes

How do Quadratic Programming solvers handle variables without bounds?

6 votes
Accepted

How to convexify log(convex) function?

6 votes

Matrix Singularity Constraint

6 votes

Index of element in MILP vector decision variable that equals 1

6 votes

Linearizing a quadratic function with more variables or not in Gurobi?

6 votes
Accepted

Forbid transformation of max(x,y) into MILP

5 votes
Accepted

Why does one objective function prove feasibility faster than another?

5 votes
Accepted

Multiple If else constraints in Mixed integer programming

5 votes
Accepted

Augmented Lagrangian Function for Semidefinite Programming Problems

5 votes
Accepted

How to reformulate a discontinuous piecewise-quadratic functions

5 votes

MILP modelling on minimal disturbance of right-hand-side to make a linear system infeasible

4 votes
Accepted

Non-linear optimization local or global solution

3 votes
Accepted

Hyperbolic constraint as second-order cone

3 votes
Accepted

How to deal with log0 in optimization problem

3 votes
Accepted

How to transform this problem with logarithmic objective function into an approximated convex optimization problem?

3 votes

CPLEX non-convex Quadratic Programming algorithms

3 votes

When is a formulation with min function an ILP problem?

3 votes

Eliminating Variables in Semidefinite Programs Using Equality Constraints

2 votes
Accepted

Linearizing a constraint with square root of a variable

2 votes

How can I model this Hyperbolic constraint?

2 votes
Accepted

Integral of PWL-Constraint in Gurobi (Java)

1 vote

How to convert an element of a variable to a convex constraint using binary variables?