Stack Overflow
Stack Overflow

Questions tagged [operations-research]

Operations Research is the application of quantitative techniques to decision making, typically involving mathematical optimization. Problems include dynamic programming, linear programming and Integer programming & discrete optimization.

Operations Research is the application of quantitative techniques to decision making, typically involving mathematical optimization. A problem is modeled as a math formulation, and the solution obtained via a solver. Problems in OR include dynamic programming, linear programming and Integer programming and discrete optimization.

The other names for Operations Research (OR) include Decision Science, Management Science, or Operational Research.

The Wikipedia page on Operations Research. INFORMS, the society for OR practitioners has a lot of relevant information.

192 questions
1
vote
1 answer

Solving a kind of knapsack prob with multiple backpacks and constraints

I have the following problem which i'd like to solve with the excel solver or any other tool (any suggestion is welcome) but I would like not to write code. I have several items (around 40) to put in several backpack (around 5). Every item has a…
AndreA
  • 779
  • 9
  • 22
1
vote
1 answer

How to extract the optimization model generated in CPLX Studio?

I have an optimization model written in IBM ILOG CPLEX studio. I want the complete model to be written in a standard mathematical programming framework on a text file. How can you do this in CPLEX studio? I can do that while using CPLEX in java, but…
Fred
  • 45
  • 4
1
vote
1 answer

Creating a tridimensional IloIntVarArray in Cplex with c++

I'm using some integers variables in cplex with c++, like: alpha = IloIntVarArray (env, numArcs,0 ,N); alpha is unidimensional array with range 0 - N... But my problem is, I'd like to create a x[N][M][K], that would be my integer decisions…
Kennedy Araújo
  • 11
  • 1
1
vote
1 answer

setting bounds for a constraint in CPLEX Concert Technology Java

I am defining a constraint in a class and later I am calling that class. Now I want to define range for the constraint created. How to set upper bound for the constraint. Relevant part of the code only I have given below. import…
wales
  • 49
  • 5
1
vote
1 answer

Multiple solutions with AMPL

I am trying to use AMPL to model a problem, and I want to be able to see alternatives, or multiple "optimal or near optimal" solutions. I read on this site: http://orinanobworld.blogspot.com/2011/02/finding-multiple-solutions-in-binary.html I have…
Derek
  • 11,715
  • 32
  • 127
  • 228
1
vote
2 answers

real world SAT instances

I'm designing and implementing a SAT solver. It would be particularly good if all clauses are of the form a AND b = c a OR b = c a XOR b = c a = NOT b In literature they use CNF form, which is I think would be a less efficient representation of the…
Albert Hendriks
  • 1,979
  • 3
  • 25
  • 45
1
vote
0 answers

Add constraints in Max-flow

I'm trying to find k(k is given) path using Max-flow from source node s to destination node t with some constraints in graph G= (V, E). Given Different subsets A_i of V, One subset can have one or more than one nodes. Problem is i can use one subset…
user3745549
  • 11
  • 1
1
vote
1 answer

Error in Java code StdRandom.uniform

I'm trying to run java code using eclipse. I'm running this code: http://algs4.cs.princeton.edu/65reductions/Simplex.java.html I got error in line 317/ 319/ 322 as "StdRandom Cannot be resolved"
user3688368
  • 19
  • 3
1
vote
3 answers

On the formulation of the linear assignment problem

I'm looking at the standard definition of the assignment problem as defined here My question is to do with the two constraints (latex notation follows): \sum_{j=1}^n(x_{ij}) = 1 for all i = 1, ... , n \sum_{i=1}^n(x_{ij}) = 1 for all j = 1, ... ,…
Daniel
  • 23,365
  • 10
  • 36
  • 34
1
vote
1 answer

Is Tabu Search stochastic or deterministic?

I'm doing a comparison of two conservation area design tools, namely Marxan and ConsNet, both of which use metaheuristic algorithms to solve a version of the minimum set cover problem. Marxan uses Simulated Annealing and ConsNet uses Tabu Search.…
RicardoC
  • 109
  • 1
  • 2
  • 9
1
vote
1 answer

"Out of domain" error in MathProg (GLPK)

I am struggling with a seemingly simple model in MathProg. The model is as follows: set W; set V; param b {W, V} binary; param p; var w {j in W} <= 0, >= 1; minimize obj: 0; subject to within_radius_of {i in V}: sum {j in W} b[i,j] * w[j] >=…
Rafael Almeida
  • 10,352
  • 6
  • 45
  • 60
0
votes
1 answer

Community-based sorting of Table/Matrix data (Visual Role Mining)

I'm looking for a way to sort a two dimensional binary matrix so that we can visually identify "communities" in the data. My data-set is based on group membership (i.e a list of people and the groups to which they belong). For example: G1 G2…
RussellZ
  • 315
  • 3
  • 8
0
votes
1 answer

Solving linear programs using Pulp but with nonlinear constraint

I am currently sovling an optimization problem using Pulp (I have to using pulp). However, the problem requires the answer of the variables to be perfect squares. Could anyone please help me how to approach with this constraint? I tried to replace…
Kelly Yang
  • 1
0
votes
2 answers

Optimization problem in C++ does not yield the same result as in CPLEX

so far I modelled optimization problems directly in IBM ILOG CPLEX Optimization Studio. Now, I want to try out using C++ to formulate models while using the CPLEX API. For this purpose, I started out with a very simple problem, just to learn C++ and…
Arctic_Skill
  • 43
  • 1
  • 1
  • 5
0
votes
2 answers

KeyError: 0 When attempting to run my LPP

I have attempted to build and solve a linear programming problem using python, however I am receiving the following error when it is ran: KeyError: 0 The following is the code I am using: bfast = 1 lunchanddinner = 2 mealstypes =…
superepp
  • 1
1 2 3
…
12 13