User ErlingMOSEK

27 votes

What instances can be solved today by modern solvers (pure LP)?

answered Jul 1, 2019 at 18:48

20 votes

Accepted

Branch and Bound Implementation

answered Jan 7, 2020 at 5:38

19 votes

Are Python and Julia used for optimization in industry?

answered Apr 23, 2020 at 8:59

17 votes

What kind of optimization problems are solved most often in practice?

answered May 19, 2020 at 6:23

15 votes

Accepted

Convexity of Variance Minimization

answered Sep 12, 2019 at 6:07

13 votes

Accepted

Why does some solvers can only solve conic optimization problems?

answered Feb 21, 2022 at 8:20

12 votes

Will there be Rust APIs for state-of-the-art solvers?

answered Jun 20 at 15:49

10 votes

How can I remember the rules for taking the dual of a linear program (LP)?

answered Jun 7, 2019 at 8:35

10 votes

Is Apple's M1 suitable for Operations Research?

answered Oct 7, 2021 at 6:07

9 votes

Model conversion as fast as gurobipy and solved by open source solvers

answered Sep 13, 2019 at 6:46

9 votes

Accepted

YALMIP-like modeling environment in Python

answered Nov 20, 2019 at 7:50

7 votes

Are there any parallel methods for solving multiple general nonlinear convex optimization problems?

answered Jan 14, 2022 at 6:09

6 votes

Simple OLS problem can only be solved in SCS. Is the dual infeasible?

answered Feb 16 at 8:49

5 votes

Poorly conditioned quadratic programming with "simple" linear constraints

answered Nov 7, 2022 at 16:42

5 votes

Accepted

Phase I of the simplex method and Farkas certificates

answered Jul 6, 2022 at 18:13

5 votes

Accepted

Eliminating Variables in Semidefinite Programs Using Equality Constraints

answered Jan 19, 2022 at 6:05

5 votes

How can I move from an optimal feasible solution to an optimal basic feasible solution?

answered Nov 2, 2021 at 6:31

5 votes

Are short-sell allowed in conic formulation of Markowitz optimization?

answered Sep 3, 2021 at 4:34

5 votes

Convex vs Strictly Quasiconvex Functions in Optimization

answered Sep 12, 2019 at 6:36

5 votes

Accepted

DCP representation of a convex quotient of affine functions

answered Apr 28, 2020 at 5:38

4 votes

What is the state of the art on the Weber problem?

answered Apr 24, 2020 at 5:16

4 votes

Mosek Fusion APIs

answered Sep 14, 2021 at 5:24

4 votes

Global Optimization when the exponential function is involved

answered Aug 20, 2020 at 5:28

4 votes

What is the go-to practical method for optimizing separable quadratic programs?

answered May 4, 2022 at 5:39

3 votes

Geometric Programming with Simple Affine Equality Constraint

answered Jun 24, 2022 at 10:25

3 votes

Number of solutions to geometric program

answered Oct 20, 2022 at 12:02

3 votes

Linear Program: Verify whether a feasible solution is an extreme point

answered Oct 30, 2022 at 13:53

3 votes

Accepted

Multithreading vs DPCC SYCL Programming for OR computational implementations

answered Feb 9 at 18:00

3 votes

Optimize parametric Log-Likelihood with a Tree

answered Dec 21, 2021 at 13:10

3 votes

How to represent the objective function of the Weapon Target Assignment problem in CVXPY?

answered Mar 9 at 18:34

Stack Exchange Network

34 Answers

What instances can be solved today by modern solvers (pure LP)?

Branch and Bound Implementation

Are Python and Julia used for optimization in industry?

What kind of optimization problems are solved most often in practice?

Convexity of Variance Minimization

Why does some solvers can only solve conic optimization problems?

Will there be Rust APIs for state-of-the-art solvers?

How can I remember the rules for taking the dual of a linear program (LP)?

Is Apple's M1 suitable for Operations Research?

Model conversion as fast as gurobipy and solved by open source solvers

YALMIP-like modeling environment in Python

Are there any parallel methods for solving multiple general nonlinear convex optimization problems?

Simple OLS problem can only be solved in SCS. Is the dual infeasible?

Poorly conditioned quadratic programming with "simple" linear constraints

Phase I of the simplex method and Farkas certificates

Eliminating Variables in Semidefinite Programs Using Equality Constraints

How can I move from an optimal feasible solution to an optimal basic feasible solution?

Are short-sell allowed in conic formulation of Markowitz optimization?

Convex vs Strictly Quasiconvex Functions in Optimization

DCP representation of a convex quotient of affine functions

What is the state of the art on the Weber problem?

Mosek Fusion APIs

Global Optimization when the exponential function is involved

What is the go-to practical method for optimizing separable quadratic programs?

Geometric Programming with Simple Affine Equality Constraint

Number of solutions to geometric program

Linear Program: Verify whether a feasible solution is an extreme point

Multithreading vs DPCC SYCL Programming for OR computational implementations

Optimize parametric Log-Likelihood with a Tree

How to represent the objective function of the Weapon Target Assignment problem in CVXPY?