As of May 31, 2023, we have updated our Code of Conduct.

Questions tagged [solver]

For questions related to software designed to solve very general classes of optimization problems to guaranteed optimality.

Filter by
Sorted by
Tagged with
1 vote
1 answer
76 views

Does OptaPlanner give equally good results when comparing with commercially available MIP solvers?

I want to solve a Mixed Integer problem with several constraints. Gurobi or Google OR tools solve such problems. Though I am not sure, I think they use an exact method such as branch and bound or ...
LSG's user avatar
  • 111
4 votes
1 answer
183 views

On the global optimization solver Octeract

A while back, I read on this forum that Octeract is free for academic use and that for commercial use it is also free but users are restricted to 1 core. I cannot find anything on the website to ...
Enthusiast's user avatar
2 votes
1 answer
147 views

Looking for a reliable and scalable open source quadratic solver

In the convex optimization community, there has been a growing concern regarding the search for a reliable open-source solver (especially a quadratic programming solver) that can effectively deliver ...
Mohammad Namakshenas's user avatar
4 votes
1 answer
200 views

MIP Model with relaxed integer constraints takes longer to solve than normal model, why?

I am currently working on my undergrad thesis which is a mathematical optimization problem of the territory design family of problems. I am using the mathematical formulation of the problem to solve ...
EduardoSalazarT's user avatar
2 votes
0 answers
62 views

Pyomo Terminal Condition: other

I have written a huge optimization code in pyomo. The code serves for any planning horizon. The variables are indexed in time (t). When I set t to have 365 days, the termination condition is feasible/...
Alex's user avatar
  • 21
1 vote
2 answers
107 views

Minimal infeasible constraint set

Many modern SAT and SMT solvers offer a feature where they can report why a problem is unsatisfiable, something called an "unsat core." Are there any optimization solvers (in my case, ...
Nate's user avatar
  • 113
3 votes
1 answer
71 views

Solver options in Pyomo as long as using the NEOS solvers

I am working on a scheduling problem that is already coded in Pyomo. To solve the problem, I have used the NEOS solver, CPLEX. Now, to test and run some of the instances, I need to call some CPLEX ...
A.Omidi's user avatar
  • 7,644
0 votes
4 answers
98 views

What is the greatest possible number of tables that could be occupied by just 1 person?

A restaurant has a total of 16 tables, each of which can seat a maximum of 4 people. If 50 people were sitting at the tables in the restaurant, with no tables empty, what is the greatest possible ...
BornPerson's user avatar
2 votes
0 answers
54 views

The linearization of the logical constraints

I know the logical constraints can be linearized by either the logical representation of whose relation, (for pure binary variables e.g. CNF/DNF) or for general form by using Big-M formulation. As I ...
A.Omidi's user avatar
  • 7,644
1 vote
3 answers
120 views

Optimization solver that satisfies variable values within set membership

Is there a solver that can handle an AMPL model of this sort: ...
wanderinganon's user avatar
5 votes
2 answers
298 views

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

Essentially, I am trying to solve a simple orthogonal least-squares (OLS) problem with some constraints — the coefficients must sum to $1$, no coefficient can be less than $0$, and no coefficient can ...
Pipob Puthipiroj's user avatar
4 votes
2 answers
484 views

Multithreading vs DPCC SYCL Programming for OR computational implementations

While well-known IP/LP solvers such as CPLEX and Gurobi have capabilities to run their solver on multiple threads, is there any tool that helps exploit the availability of not only multiple threads on ...
Tryer's user avatar
  • 151
7 votes
3 answers
1k views

Solver for convex optimization with exponent in the objective function

My question is related to a previous one: Dedicated solver for convex problems To minimize a convex function of the form $~f(x_i) = \left[ C + mx_i + \frac{s}{x_i+t} \right]^p $ with various ...
Shuxue Jiaoshou's user avatar
2 votes
4 answers
316 views

How to approach this shifts problem with Excel Solver?

I am trying to find a way to solve the following problem of mine by using Solver but I get stuck right at the end of it. I have a table of 14 companies each of which want to work on a project. I will ...
Tita's user avatar
  • 205
0 votes
1 answer
106 views

Pyomo.solvers on anaconda mac Ventura 13.0.1 (22A400)

I am facing difficulties to install pyomo.solvers for anaconda I do need glpk cbc ipopt for my anaconda I tried the following ...
Optimization team's user avatar
4 votes
2 answers
369 views

Expected ILP solving time and how to improve speed

I am trying to solve this ILP with all binary variables: $$\min \sum_{1\leq i<j\leq n-1-h} t_{i,j}$$ $$\sum_{i=1}^{n-1-h} a_{k,i} = \lfloor (n-1)/2\rfloor \qquad \text{for }k\in[h];$$ $$a_{k,i} + ...
BillyJoe's user avatar
  • 393
3 votes
2 answers
161 views

Find all pivots that the simplex algorithm visited, i.e., the intermediate solutions, using Python

For my research, I am interested in finding the trajectory outlined by the pivots along the way of optimizing an LP problem, but I only know how to use Python PuLP to obtain the optimal solution. Is ...
Miya's user avatar
  • 31
3 votes
1 answer
152 views

Where to find "MIP Emphasis" parameter in the CPLEX IDE?

I am also looking to solve a MIP with heuristic algorithms and read in the guide that I need to modify the "MIP emphasis" parameter. Is there a way of doing this in the CPLEX IDE? All I can ...
twaits791's user avatar
3 votes
2 answers
286 views

How to view pause and view current solution in CPLEX Optimization Studio?

I am solving my first model in CPLEX 22.1. I have setup a quadratic MIP with 100 variables and the model has been running for a day already with the best integer and best bound solutions barely ...
twaits791's user avatar
2 votes
1 answer
191 views

CPLEX stuck in solve method - dual simplex solved model

I am solving a (rather large) MILP in CPLEX in Java. I also wrote a solution extractor method, which works most of the time. However, when CPLEX tries to solve my problem with the dual simplex method ...
Juul9191's user avatar
3 votes
2 answers
585 views

Tutorial request on implementing HiGHS solver

In the past I have used the academic versions of Gurobi and Mosek for solving various optimization problems using various Python and Julia libraries that call the solvers. However, I want to learn how ...
Marion's user avatar
  • 133
5 votes
1 answer
1k views

How to call HiGHS solver from python PuLP MIP?

I have a large MIP built with PuLP in python, and want to utilize the HiGHS Solver. However, PuLP does not have the option to use HiGHS as a solver. One option I am aware of would be to use PuLP to ...
Mason's user avatar
  • 485
2 votes
0 answers
125 views

Simplex Method Manual pivoting in GLPK for a Warm Start

My question is kind of related to this 2015 post at Stackoverflow. About Simplex method tableau pivoting in Linear Programming -- this is proving to be difficult in GLPK.. I am using Linux, GLPK 5.0 ...
Shuxue Jiaoshou's user avatar
5 votes
1 answer
162 views

How to enumerate all vertices of a polyhedron as a stream

I need to find the vertices of a polyhedron from the defining halfspaces. In a previous question libraries for enumerating all vertices were mentioned. However i have a very large polyhedron (~100,000 ...
Daniel's user avatar
  • 103
2 votes
1 answer
120 views

Looking for a specific operations research software

I would like to ask for help to identify the research operational software that is being used in the picture I think it looks nice and I'd like to use it (It doesn't seem to be Lingo nor Excel Solver)...
Fischer3000's user avatar
3 votes
1 answer
187 views

LocalSolver at 100% Gap

Can somebody help me with Localsolver? I have installed the academic license and want to solve Split Delivery VRP. I'm using the same model as seen in the website here and using the same instances too ...
overboxed's user avatar
  • 573
4 votes
1 answer
153 views

Solution time of different formulation

In MIP, what's the difference of solving time between the following two formulations? $x_i = 0$ for $i\in I$, and $\sum_{i\in I} x_i = 0$. Suppose that $x_i, \forall i\in I$ are all binary variables....
nousername's user avatar
11 votes
0 answers
131 views

which method has been used to automatically reformulate logical constraints in a standard MIP solver?

There are many of the formulations to linearize logical constraints by introducing new auxiliary binary or any appropriate variables and adding the corresponding constraints to the model. It can be ...
A.Omidi's user avatar
  • 7,644
3 votes
0 answers
140 views

Can Pyomo be linked with Google's GLOP or CP-SAT solvers?

Pyomo can be linked with several solvers Open source and commercial ones. I was wondering if Pyomo can be linked with Google's GLOP or CP-SAT solvers?
Optimization team's user avatar
9 votes
2 answers
929 views

Gurobi finishes with 'infeasible' although optimal solution exists

I am using Gurobi (in Python through gurobipy) to solve an IP on tournament graphs. I am searching for a non-zero minimal integer weighting such that for every vertex the sum of weights put on the ...
Legsleg's user avatar
  • 153
1 vote
0 answers
208 views

How to make unconstrained variables non-negative (as in excel solver) in AMPL?

This is a sequencing problem. I've got this variables ...
Don Quijote's user avatar
2 votes
0 answers
191 views

CP sat solver approach for task assignment with pre defined task start end times

I spent some time trying to clarify the problem more succinctly. I has a set of fixed tasks which are of a certain type/category and which can be allocated to a set of workers. The tasks have ...
ana's user avatar
  • 21
2 votes
1 answer
129 views

Coding some parameters with index zero in Julia

As part of our constraints, we have \begin{align*} &\sum_{i=1}^{I}c_ix_i\ge y, \\ &\sum_{i=1}^{I}c_{i-1}x_i\le y, \end{align*} where $y\ge0,x_i\in\{0,1\}, \forall i$. I am trying to code ...
user avatar
0 votes
1 answer
218 views

It takes a long time to solve excel gurobi-opensolver - is this normal?

The problem I have made associated with OpenSolver and Gurobi takes about 50 minutes to solve, is this normal? It has approximately 365 variables with upper and lower bands, the peculiarity is that ...
ADMGYP's user avatar
  • 49
1 vote
0 answers
117 views

How to solve this problem with Gurobi add-in Opensolver excel

My main problem is that, when I try to solve an optimization using Gurobi with the OpenSolver add-in, I get the error that there is no feasible solution. To summarize, my variable $X_i$ has a maximum ...
ADMGYP's user avatar
  • 49
3 votes
1 answer
267 views

Meaning of infeasible model: unsuccessful solving for an IP model with binary variables

For fun, I have modeled the Union-closed sets conjecture for a universe of a given size into a problem with binary variables. Each binary variable $x_k$ is the indicator of the set with elements ...
BillyJoe's user avatar
  • 393
3 votes
0 answers
202 views

Adequate SDP solvers for large problem instances

I have previously used MOSEK for all my SDP needs. Recently, though, I am having a hard time trying to solve some large problems, due to lack of memory. In similar questions around the forum, SCS has ...
cdg's user avatar
  • 39
5 votes
2 answers
800 views

Knapsack - How to optimize bonuses for each pair of items

I am trying to solve a variation of the knapsack problem where every pair of items in my knapsack has a bonus or penalty associated with it. My knapsack can hold a dozen items There are thousands of ...
Eddie's user avatar
  • 197
1 vote
0 answers
138 views

How to use ampl.lic in Pyomo

I have the licence of some solvers and I want to use these solvers in Pyomo. The licence file is ampl.lic and my machine is Macbook. I have an executable file for Baron solver which is only for demo ...
hamta's user avatar
  • 77
2 votes
0 answers
98 views

Pyomo optimisation not working (gas plant dispatch)

background I am trying to write an pyomo script to optimally dispatch a gas plant based on perfect foresight of electricity prices. I believe I am 90% of the way there, just a few issues. Problem The ...
Bobby Heyer's user avatar
2 votes
1 answer
260 views

Solver for nonlinear semidefinite optimization

Totally new to optimization. Is there an easy-to-use solver, package, (free) software for solving nonlinear semidefinite optimization problems?
Morcus's user avatar
  • 129
6 votes
0 answers
84 views

Issue of Dense columns in the formulation

I'm working on a price-selection model where we need to identify price point for each time-period (could be day/week). Objective of the model is to figure out optimal price-point for each time-point ...
anjikum's user avatar
  • 959
4 votes
1 answer
356 views

Why does some solvers can only solve conic optimization problems?

Famous solvers like sedumi, sdpt3, mosek can solve conic optimization, but not more general convex optimization. Why? I know many convex problems can be formulated as conic, but still confused.
Tim's user avatar
  • 43
2 votes
2 answers
146 views

Minimizing a KS function

For convex functions $f_i, \ i \in I$, the KS function is defined as the following for any $\rho > 0$: $$KS[\{ f_i \}_{i \in I}](x):= (1/ \rho) \ln \left[ \sum_{i \in I} \exp(\rho f_i(x)) \right].$$...
independentvariable's user avatar
6 votes
3 answers
610 views

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

I want to find a parallel computing method for general nonlinear convex optimization problems with constraints. A parallel method that can solve a bundle of nonlinear convex problems simultaneously, ...
dawen's user avatar
  • 169
3 votes
0 answers
52 views

Indeterminacy Reduction for MINLP

I am considering a Mixed Interger NonLinear Program (MINLP), and using a solver to obtain admissible solutions. Is there a general method to reduce indeterminacy of solutions (e.g. by adding ...
Meth's user avatar
  • 424
0 votes
1 answer
87 views

How can we prove the solvability time of a linear program?

Given a linear program, by experimentation, I can see that the solver can solve large instances in a few seconds. How can I prove that my LP is in polynomial time, or can we say that it is just by ...
MAJID majid's user avatar
3 votes
0 answers
130 views

Are there hybrid metaheuristic-solvers to solve combinatorial optimization problems?

I have a problem which is formulating a linear program. To solve large instances I implement a metaheuristic to solve my problem. In my problem, I have two objective functions. With my linear program, ...
MAJID majid's user avatar
3 votes
0 answers
96 views

Availability of library for solving generalized network flow problems

I need to solve a large-scale generalized network flow problem. For reference, it is a pure network-flow model with the exception that arcs have a positive coefficient applied to flow on them. In my ...
Suleyman Karabuk's user avatar
2 votes
1 answer
267 views

Excel Solver: Solving matrix values to match row/column sum according to reference

I've been trying to program Excel Solver to fill the values of a matrix so that the sum of rows and columns match preestablished values. See image: Excel Problem I understand this problem has infinite ...
fpolloa's user avatar
  • 21