Skip to main content
Filter by
Sorted by
Tagged with
0 votes
0 answers
73 views

I am studying the cycling of simplex method. I know that there is a lexicographic rule to prevent looping of the simplex method, and I also know that this rule should be applied to a lexicographically ...
Аноним Анонимович's user avatar
0 votes
0 answers
64 views

Trying to implement and solve a Linear Programming problem with in Java using apache-commons-math: <dependency> <groupId>org.apache.commons</groupId> <...
remi's user avatar
  • 3,996
5 votes
2 answers
564 views

Question for 'experts' in LP using R (using the lpSolve package, say) -- which does not apply to me for the sort of problem I describe below. I've run any number of LP's using lpSolve in R, but all of ...
Johnny Canuck's user avatar
1 vote
1 answer
1k views

The function takes in the coefficients of the objective function, the constraints matrix, the right-hand side values for the constraints, the direction of the constraints, and the type of the LP ...
proxyy's user avatar
  • 11
0 votes
1 answer
91 views

In traditional Simplex Algorithm notation, we have x at the current basis selection B as so: xB = AB-1b - AB-1ANxN. How can I compute the AB-1AN term inside a separator in SCIP, or at least iterate ...
Brannon's user avatar
  • 5,422
0 votes
1 answer
72 views

I'm trying to write a custom separator (aka, MIP cutter) to my SCIP model (in Python). To do this I need to detect which constraints are tight/binding at the given MIP node. I thought that I could do ...
Brannon's user avatar
  • 5,422
-1 votes
1 answer
78 views

I was wondering if, given a min cost flow problem and an integer n, there is an efficient algorithm/package or mathematical method, to obtain the set of the n-best basic solutions of the min cost flow ...
Giacomo's user avatar
  • 101
0 votes
0 answers
599 views

I am new to linear optimization and currently trying to use the SimplexSolver.class from org.apache.commons.math3.optim.linear. So I looked up some examples on how to use it, to understand it and also ...
Mr. Moose's user avatar
  • 111
1 vote
2 answers
463 views

I have been writing some code for automatically aligning my fiber (whose X, Y, Z positions are controlled by a motor) to a light source. For this I have written my axis.move_to(pos) method to move an ...
Enzo's user avatar
  • 368
1 vote
0 answers
394 views

After doing a lot of research I'm unable to find a network simplex algorithm for Python. This algorithm has been implemented in many other languages so there must be a python implementation I guess? I ...
learnPyt's user avatar
0 votes
1 answer
748 views

I'm trying to solve a transportation problem using the networkX library. As my demand and supply values are floats my problem seems to be unsolvable by the networkX package? see documentation on Page ...
learnPyt's user avatar
0 votes
1 answer
1k views

I'm trying to implement a revised simplex method (RSM) algorithm using Python and numpy. I'm stuck with its either working on maximization only (correct on tiny matrices like 2x4, 5x5 etc and wrong on ...
ntonk's user avatar
  • 115
0 votes
1 answer
163 views

I am trying to create a table that can have user input. I want to have a table with boxes instead of asking the user for a list of numbers, they can just input a lot of numbers into the table. Right ...
Alex's user avatar
  • 11
0 votes
1 answer
253 views

I have got my equations and everything set. I just don't know how to iterate, i.e. how to update A, b and c. I have been trying with the matrix form. If anybody could help with that or the tableau ...
huy's user avatar
  • 306
0 votes
1 answer
178 views

Suppose that we have a linear program (LP) that has at least two optimal bases B1 and B2. Are the dual values associated with B1 equal the dual values associated with B2? In other words, can we ...
user108724's user avatar
2 votes
1 answer
342 views

I am trying to solve the problem described by Saul Grass in his book "Illustrated Guide to Linear Programming", page 12ff The transportation problem. Refrigerators have to be delivered to 3 ...
F Massion's user avatar
2 votes
1 answer
442 views

I'm trying to optimize the following: people (column id) should go to one of the points A:G. Let's say that exactly two people (from a group of 14) must go to one of the 7 locations. I want to ...
Marcelo Rodrigues's user avatar
0 votes
4 answers
3k views

This is the problem statement An Indian farmer has a piece of farmland, say L square kilometers long, and wants to either sow wheat or rice or a combination of both. The farmer has a limited amount of ...
xicor's user avatar
  • 21
2 votes
0 answers
1k views

I am trying to estimate the error/uncertainties in the estimation of the power-law fitting parameters (m, n, b) of the form y = m(x-b)^n, which I fitted to a dataset. When I use the Nelder-Mead method ...
nebula1's user avatar
  • 71
0 votes
1 answer
88 views

I am reading simplex algorithm in text book titled Algorithms by Dasgupta-Papadimitriou-Vairani On each iteration, simplex has two tasks: 1. Check whether the current vertex is optimal (and if so, ...
venkysmarty's user avatar
  • 11.5k
1 vote
1 answer
1k views

I am trying to figure out the simplex algorithm in the book "Introduction to Algorithms, 3rd edition". The procedure "Initial-Simplex" takes as input a standard form, and check if there is an initial ...
tjfy1992's user avatar
0 votes
0 answers
225 views

Objective function => x1 - 2x2 Subject to => x2 <= 5 x1 - x2 >= 2 x1 ,x2, x3 >= 0 Maximize? convert to standard form : Maximize -> -x1 + 2x2 Subject to -> x2 <= 5 -x1 + ...
Kavishka Gamage's user avatar
1 vote
1 answer
1k views

I am trying to implement a simplex algorithm following the rules I was given at my optimization course. The problem is min c'*x s.t. Ax = b x >= 0 All vectors are assumes to be columns, ...
campovski's user avatar
  • 3,211
0 votes
0 answers
1k views

I need Big Datasets to test a parallel version of the simplex algorithm i am writing. The only Datasets i can find are in a Format called MPS but i cannot find a parser for MPS in Python or C. I ...
Lou K.'s user avatar
  • 76
0 votes
0 answers
160 views

A common linear programming problem below min c'x s.t. Ax<=b (A is m*n, m is smaller than n) As I know, the pivoting procedure in simplex method lets extreme point jump to another extreme point ...
朱恆毅's user avatar
0 votes
1 answer
126 views

I have a problem with 841 variables and 23382 constraints (not particularly large for LP). Nevertheless, i get an OutOfMemoryError when using the Apache SimplexSolver, even for a heap size of 1GB. ...
tnogueira's user avatar
1 vote
1 answer
1k views

I am trying to use linprog in order to optimise the following problem (uploaded in Google Drive). The dataset itself is uploaded here So far I have the written the following implementation in Python: ...
Vasil Yordanov's user avatar
1 vote
1 answer
866 views

I am currently working on a problem which can be solved using linear programming according to the research I have done here, on YouTube and on other websites. I have familiarized myself with the so ...
Dizarb's user avatar
  • 19
1 vote
0 answers
2k views

I am looking for an Excel table with formulas (no VBA, no Solver) that can solve LP problems: Ax=b 0<=x cx->min With Solver and VBA, I can do it but I would like a solution which builds only on ...
z32a7ul's user avatar
  • 3,857
0 votes
1 answer
826 views

I am using the linprog function in Matlab to solve a set of large linear programming problems. I have 2601 decision variables, 51 inequality constraints, 71 equality constraints, and lower bounds of 0 ...
Fred's user avatar
  • 135
0 votes
1 answer
371 views

I am working on an algorithm which has the following things A = np.array([[10, 5, 1, 0, 0], [6, 6, 0, 1, 0], [4.5, 18,0, 0, 1]]) nonbasis = np.array([0, 1]) basis = np.array(...
RK_31's user avatar
  • 1
1 vote
1 answer
135 views

i have made this table in excel of items of food from a menu with their nutritional value. I've then got another table that has each item in one row and the quantity consumed of each item In the row ...
user123's user avatar
  • 111
0 votes
1 answer
153 views

I started using R to solve a LP-Problem using the simplex funciton from library("boot"). When i try the following code I only get the target vector as string but not as a vector. library("boot") # ...
jan-seins's user avatar
  • 1,303
0 votes
2 answers
955 views

I have been tasked with created a web-based machine for solving real-world issues using Linear Programming techniques, specifically at present, Danzig's Simplex Method. With this in mind I've found a ...
user avatar
0 votes
1 answer
102 views

I was trying to do a regular simplex (the notion of a triangle or tetrahedron to arbitrary dimensions) to start an optimization set of experiments. The Optimsimplex package provides an easy and useful ...
Cris's user avatar
  • 334
1 vote
1 answer
2k views

I have a linear programming problem that I'm trying to solve in R. I have used lpSolve package. lpSolve by default uses primal simplex algorithm to obtain solution. What if I want to change the ...
forecaster's user avatar
  • 1,159
1 vote
1 answer
6k views

Good morning, I have a question to an optimization problem I can't solve in R but in Excel: I would like to optimize the following situation (Transportation of material and people): Airline x1 can ...
Carlos's user avatar
  • 49
0 votes
1 answer
2k views

Is there any reliable tool or source code (preferably C++) for solving LPs with bounded variables by simplex method? In my problem all variables are bounded to 1. I actually found some tools in ...
Masoud's user avatar
  • 305
1 vote
1 answer
669 views

I'm new to world generation and the algorithms which are used for them, so I hope someone can give me some usefull explanation or code or both or links to some resources I missed while searching for a ...
ShadowDragon's user avatar
  • 2,428
-1 votes
1 answer
149 views

I am running a code that needs to calculate the appropriate percentage of ingredients to compose an animal food. In order to do it I am using MS solver foundation. I set the model passing the minimum ...
Raul Peres de Góes's user avatar
0 votes
0 answers
132 views

I am using a function in Matlab based on lp_solve. In my case, lp_solve is structured as follows: A = rand (13336,3); %A is made of real numbers between 0 and 1. For this mwe, I thought 'rand' was ...
Patapunfate's user avatar
2 votes
0 answers
1k views

I use Matlab's fminsearch function for finding the minimum with Nelder-Mead. fminsearch calculates the size of the initial simplex automatically. In my case, the initial simplex is too small, thus it ...
machinery's user avatar
  • 6,390
2 votes
0 answers
445 views

This is a follow-up question to the SO question: Code a linear programming exercise by hand . I have a similar interest in implementing the simplex algorithm (linear programming) for pedagogical ...
thor's user avatar
  • 22.7k
0 votes
2 answers
7k views

I find topic about Simplex method here Alter Simplex Algorithm to Minimize on objective function NOT maximize But answer didn`t help. When I change from double[] variables = { 13.0, 23.0 }; to ...
user3650408's user avatar