Questions tagged [mixed-integer-programming]

For questions about mathematical optimization problems involving both continuous and binary or general integer variables.

Filter by
Sorted by
Tagged with
3
votes
2answers
111 views

A relaxed version of job shop scheduling

I am working on a formulation for a problem that seems similar to the bin packing problem. My problem variables include items that are to be placed in bins, special events that are conditionally ...
1
vote
1answer
97 views

Why some decision variables don't get values in Cplex?

I use this code in the cplex and don't know why some decision variables don't get value, I attach my code below. I don't know my model is wrong or my code? I haven't error in the code but have some ...
5
votes
2answers
597 views

How to transform this logical if-then constraint?

Consider the binary variables $x, y, z \in \{0,1\}$. I'd like to formulate the two if-then constraints: $$ x + y \geq 2 \implies z = 0, \tag{1} $$ $$ x + y \leq 1 \implies z = 1. \tag{2} $$ Constraint ...
2
votes
2answers
281 views

Cutting Stock Problem : Mixed Integer Programming

I am asked to solve the following problem: The problem: You were asked to repair a farm house with sheets of plywood. You were given thirty sheets of plywood. (each size = 10ft x 10ft) The house ...
-3
votes
1answer
97 views

is this a mistake or not in this tutorial?

Please consider https://stoprog.org/what-stochastic-programming and look at "A SIMPLE INTEGER RECOURSE MODEL" at "Stochastic Integer Programming" section. Should not $b_i$ be $...
3
votes
0answers
50 views

Solving a nonlinear model with constraints of exponential functions and continuous variable multiplications

I have a nonlinearly-constrained model and wonder if a nonlinear solver like Ipopt or Knitro can solve the problem. Briefly, my objective function is linear. I have the following variables with their ...
5
votes
0answers
51 views

Reference request — fishery yield optimization

I'm looking for references to do a review of research on managing fisheries in industry. I've seen adaptions of population growth models which include some harvesting constant or function and was ...
3
votes
0answers
30 views

PuLP Python: How to linearize an inequality involving an integer variable

I am working on a Copper payables problem where the objective function is to maximise the sum of copper payable over a time period, T. The total amount of payable tonnes i.e. what the customer will ...
1
vote
1answer
59 views

How define variable in CPLEX and What is diffrence between decision variables and variable in CPLEX

I want to code a problem by CPLEX, in this problem I have variables and decision variables, how define them? In this picture you can see the variables: which we have: I use these codes for variables:...
2
votes
1answer
57 views

Generating a different optimal solution from CPLEX for each run

I recently chanced upon the idea of solution diversity through the setting of random seeds within CPLEX. However, the documentation page on the settings does not shed any light with regard to the ...
2
votes
1answer
104 views

How can I have minimum amount of resources wasted in this resource allocation problem?

I have a demand, $d$ I also have supply from 1000 sources. The supplies from those $N$ (for example, $N=1000$) sources are given by $s_1,s_2,s_3,\cdots,s_N$. So,the total supply is : $s_1+s_2+\cdots+...
1
vote
1answer
75 views

Coding the OR problem with cplex

I am new to using OPL. I wrote a CPLEX code for the vaccine distribution from a paper, it doesn't get an error, but it hasn't given the answer. I don't know its problem; please help me; I attached the ...
4
votes
3answers
140 views

How can I find the optimal assignments for this MILP problem heuristically?

I have an assignment problem as follows $\begin{equation} \begin{array}{*{35}{l}} \underset{d_{u,c}}{\max}\hspace{1mm}\hspace{1mm}\sum_{u=1}^{U}\sum_{c=1}^{C}d_{u,c}\omega_{u,c}\\ \text{}\text{...
4
votes
2answers
166 views

Two-Objective Optimization in CPLEX

Until now, I used CPLEX to solve single-objective optimization problems only, but now I need to solve a two-objective mixed-integer linear optimization problem and I noticed that CPLEX 12.6.9 (unlike ...
6
votes
1answer
943 views

What are good reference books for introduction to operations research?

The reference books should cover the wide range of problem-solving techniques and methods.
3
votes
3answers
155 views

How can I direct the behaviour of a MILP Solver

I have a model involving constraints of the form $$d(i) = a \cdot W(i) + b \cdot B(i)$$ where $W(i)$ is binary and $d(i), B(i)$ are positive reals. The objective function is $\max\sum B(i)$. While ...
13
votes
3answers
952 views

How to model a mixed-integer linear programming formulation in Python using Gurobi?

I can remember that I spent some time in understanding how to formulate my first model. So I aimed at presenting a complete model here, wishing to save some time for students or researchers needing it....
9
votes
2answers
447 views

Warm-start SCIP with a solution

I am trying to solve a MIP using SCIP. I let my solver run for some initial time-bound - let's say 10min. After 10min, I check if the problem is solved to optimality or 1% gap. If not, then I would ...
2
votes
1answer
76 views

Minimizing a quadratic binary nonconvex function by CPLEX

I am using CPLEX 12.8 to minimize a quadratic binary nonconvex function, according to quadratic function by CPLEX. In particular, my function is the following: $$ \sum_{i=1}^{m-1} \sum_{f=1}^{F} \sum_{...
3
votes
2answers
67 views

How to improve relative mip GAP using CPLEX in a MIP

Supose that I have an integer feasible solution for a MIP and I provide this one for CPLEX. I have tested this situation in a problem and CPLEX have reported the following: ...
3
votes
1answer
119 views

Problems finding a feasible solution in a MIP

I am using CPLEX with Julia using the package JuMP to solve a MIP problem. In a small instance, I have tested my problem but, after 10 minutes, nothing happens. I have defined the following parameters ...
5
votes
1answer
97 views

Are there strategies/rules/systematic approaches to derive alternative formulations for an optimization problem?

For a given optimization problem there are often many known math programming formulations. For example for the TSP here is a survey https://link.springer.com/chapter/10.1007/3-540-36626-1_5 of many ...
6
votes
1answer
127 views

Formulating two non-negative variables without binary and/or big-M

There are two non-negative integer variables $q$ and $p$, where only one of them can take a positive value. To impose this relation, I write: \begin{align} q &\leq M(1 - y) \tag1 \\ p &\leq M(...
5
votes
0answers
44 views

What are useful plots/statistics/metrics when analyzing the solution sensitivity in multi-objective optimization?

Consider an optimization problem with $n>3$ objectives. For handling this there exists often two approaches: a) some weighting of the objectives, b) fix an order of objectives and then optimize ...
2
votes
1answer
46 views

MIP for resources to task assignments

I have few tasks t1, t2, t3, t4, t5 which need to be assigned to resources r1, r2, the tasks are located across multiple ...
38
votes
8answers
1k views

Optimization Problem Libraries

Can someone please make a list of optimization problem libraries so that the community can add to and refine it? I know a few off the top of my head.
4
votes
1answer
95 views

k -MST problem based on Miller-Tucker-Zemlin subtour elimination constraints

Where can I find the formulation of the $k$-MST ($k$-minimum spanning tree) problem as (mixed) integer linear program based on Miller-Tucker-Zemlin subtour elimination constraints (MTZ)?
3
votes
1answer
89 views

Lagrangian Relaxation The Weak Lower Bound

I am applying Lagrangian Relaxation with Subgradient Optimization Method and trying to solve a MIP model. Before testing the large-scale instances, I wanted to see how it performs on small-size ones. ...
4
votes
1answer
105 views

Free solver for MINP problems

I have a mixed-integer nonlinear programming (MINP) problem. Is there a free solver for such a problem?
2
votes
1answer
141 views

Working with large models

I am working with a variant of TSP, number of nodes that I need to test are in between 2500 to 3000 nodes, I am using docplex for modelling, I have a 8 gb Ram but it gets filled with only 400 nodes. ...
7
votes
3answers
527 views

Cplex 12.10: How can I solve an LP relaxation?

I have an IloCplex object which contains a MILP. Is there a way to obtain the objective value of its LP relaxation, without having to rewrite the entire model as ...
2
votes
1answer
243 views

If else condition to MILP

I have following problem: $c_i = 1$ if $X + \sum_j^N G_j = T$ else $c_i = 0$ Also there is another constraint which upper bounds equation $X + \sum_j^N G_j \le T$. $c_i$ is binary $X, T$ are ...
3
votes
2answers
174 views

Modeling in integer programming vs modeling in constraint programming

I have some experience with linear and integer programming modeling (I read Model Building In Mathematical Programming by Williams). Now I am trying to learn how to model with constraint programming. ...
4
votes
4answers
425 views

What expresses the efficiency of an algorithm when solving MILPs

What is the appropriate measure to indicate the efficiency of an algorithm\model that solves a MILP through B&B? Is it the number of nodes examined to reach the optimum? the number of iterations ...
3
votes
2answers
121 views

Should I use Special Ordered Sets in MIP model

I investigating various aspects of MIP and I can see that my current modelling langaunge support Special Ordered Sets(https://python-mip.readthedocs.io/en/latest/sos.html) but looking at the papers ...
4
votes
1answer
118 views

Using LR-based method to solve mixed integer programming

When we use Lagrangian relaxation-based methods to solve mixed integer programming, does the convergence of multipliers to the optimum as well as convergence of primal variables to the optimum happen ...
3
votes
1answer
78 views

In integer programming what's the difference between using lower upper bound constraints and using a big M constraints?

I've noticed that for integer programming models with binary variables some use upper bound constraints and others use big M constraints in order to have two mutually exclusive choices. I have trouble ...
3
votes
0answers
64 views

“Rank 1” type constraint $X=vw^\top$: MILP representation? Convex relaxation? Other tractable approach?

Suppose $X\in\mathbb{R}^{m\times n}$, $v\in\mathbb{R}^m$, $w\in\mathbb{R}^n$ are variables from an optimization problem, which also includes the constraints: $$0\le v\le a$$ $$0\le w\le 1$$ $$w_1+\...
2
votes
1answer
96 views

Defining Solution Space in MILP / LP using If Then Statements

I have the following statements for an MILP: Variables: $c$ (can be $1$ or $0$); $\alpha_j$ (real numbers with $0\le\alpha_j\le1$). I have a linear inequality system for $\alpha_j$: $\sum_jv_j\...
4
votes
2answers
129 views

Best practices regarding using “aggregated variables” in MIP

I have a variable that can be defined as a sum of other variables. Should I create this variable and add a constraint that they are sum of the other variables or should use the minimum number of ...
3
votes
1answer
52 views

Strict inclusion for facility location formula and aggregate facility location formula

I am trying to prove that $P_{FL} \subset P_{AFL}$ where \begin{align}P_{FL}&=\left\{({\bf x},{\bf y})\,\,\middle\vert\,\,\forall i,j:\sum_{j=1}^nx_{ij}=1,x_{ij}\le y_j,0\le x_{ij},y_j\le1\right\}\...
3
votes
1answer
310 views

Simplex (GLPK) doesn't find a feasible solution on this simple assignment problem, but there is an obvious one

Problem Assign 11 projects to 11 students, based on their preference. For this example, each students chooses only one project, for simplicity shake (as shown below). Student 1 one chooses project 1, ...
3
votes
2answers
247 views

Calculated CPU time of C++ is different from actual time to solve MILP model via Gurobi

I am solving a MILP model in C++ using Gurobi 7.5.2. More specifically, I am determining the CPU time of my C++ program via the following commands: clock_t start_time; double elapsed_time; start_time=...
2
votes
2answers
95 views

Constraint to handle the machine-configuration's change between initial position and its first occurrence in the process

I am working with a kind of a reconfigurable process planning, meaning that the same machine can have different configurations and perform multiple operations. Each machine has an initial ...
3
votes
1answer
183 views

Why does the getTime() function from cplex concert returns wrong value?

I am running a MILP formulation (implemented in C++) with the Cplex Concert Technology 12.10, and I am trying to get the total elapsed time. So till the moment, I have tried three approaches: Be ...
0
votes
0answers
76 views

Linearization of constraints with square root

I am trying to solve an optimization programming model involving a non-linear constraint with a square root. It follows (in a simplified form): $X_i\ge\sqrt{A_i/B_i}$ where $X_i,A_i,B_i$ are positive ...
5
votes
1answer
107 views

How to check whether two formulations are equivalent?

I am given two formulations, that is, two integer programs $ (IP1)\quad \min \{c^tx \mid Ax\geq a, x\in Z^n\} $ and $ (IP2)\quad \min \{d^ty \mid By\geq b, y\in Z^m\} $ and I wish to check whether ...
1
vote
1answer
622 views

How to describe the traveling salesman problem with an integer programming model?

I'm trying to describe the travelling salesman problem as an integer programming model. I'm interested in the asymmetric version of the problem. The problem can be summarized as finding the optimal ...
5
votes
2answers
222 views

Shortest path problem with underlying continuous variables

I recently got interested in the following variation of the shortest path problem. I've looked in the literature for days but I couldn't find any paper studying this problem. I'd like to ask if you ...
2
votes
1answer
177 views

How can I convexify (allowed some approximation) the objective function?

I have a known matrix, $H$ of size $U\times B$. The optimization variable is $D$ of same size, which is binary Now I have $$S_u=\frac{\sum\limits_{b=1}^{B} D_{u,b}H_{u,b}}{\sum\limits_{b=1}^{B}H_{u,b}-...

1
2 3 4 5
7