Stack Overflow
Stack Overflow

Questions tagged [simplex]

A simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension.

129 questions
0
votes
0 answers

Downhill Simplex on finite intervals

I've been reading up on Downhill Simplex (Nelder-Mead) optimization, but what I was missing were good proposals on what to do when the parameters / coordinates are bound to a fixed interval. What is the best way to handle the case that one parameter…
Martin
  • 21
  • 1
0
votes
1 answer

Excel Solver MOLP - is there a way to Maximise Amount whilst Minimising cost?

Is there a way to use solver in a way to maximise X wilst using as little of budget Y as possible? Looked onlime but can't find any MOLP videos using excel, mainly just mathematical literature. this comes about as after using solver, I noticed that…
Reece Donaldson
  • 3
  • 1
0
votes
0 answers

Create a simple method calculator lpp

Yo, Need Help for making a simple method LPP calculator. if someone know begging to help me because i was found myself making an GUI about that calculator making a software that calculate LPP problem
Azumi
  • 1
  • 1
0
votes
1 answer

Algorithm-finding-dedicated-sum-from-the-population-of-variables

I need a way of finding an exact value made of the sum of variables chosen from the population. The algorithm can find just the first solution or all. So we can have 10, 20, or 30 different numbers and we will sum some of them to get a desirable…
Celltech
  • 1
  • 2
0
votes
1 answer

Systems of Linear Equations

I am using the following code to find x and y in this linear equation. I was wondering if there is a way to add two more constrains to the following equation? For example, how can we add x>0 , and y>0 to the following equation(3x+4y=7 and 5x+6y=8)to…
Mehmet Fatih Yasar
  • 39
  • 3
0
votes
1 answer

is there a way in OPL to maximize the minimun of a list of decision variables?

I want to do something like this: dvar Q [1..10]; maximize min(i in 1..10) Q[i] ; Q has 10 different values which i don´t know, i want that the minimun of all those values be as high as possible But this doesn´t allow me to use Q which is a…
user16555238
  • 1
0
votes
1 answer

networkx network_simplex function overflow warning without floating numbers

I am trying to use the networkx network_simplex() function with a directed graph. In the official documentation it says: This algorithm is not guaranteed to work if edge weights or demands are floating point numbers (overflows and roundoff errors…
oakca
  • 1,408
  • 1
  • 18
  • 40
0
votes
1 answer

How to manually code 1-norm regression as a matlab function, using the below algorithm

I am not sure if what I have done so far is correct, and I need help with the iterative step as I don't understand what is going on in the algorithm. Here is my code. Help to finish this would be much appreciated. Thank you function x_opt =…
Shrine 420
  • 1
0
votes
1 answer

Projected gradient descent on probability simplex in pytorch

I have a matrix A of dimension 1000x70000. my loss function includes A and I want to find optimal value of A using gradient descent where the constraint is that the rows of A remain in probability simplex (i.e. every row sums up to 1). I have…
Pratik Karmakar
  • 47
  • 5
0
votes
1 answer

Issue with seamless 1-D SImplex noise

Typically when generating seamless Simplex noise the strategy is to go to 4-dimensions (a strategy which has worked well for me in the past when using 2-D Simplex), however I am trying to generate a seamless GIF loop using 1-D simplex noise (only…
erik
  • 3,810
  • 6
  • 32
  • 63
0
votes
0 answers

GLPK - upper bound constraint does not work properly

I am using GLPK and I am struggling in understanding why an upper bound constraint is not respected. I have something like this: param n0; param n1; param n2; param start_0{i in 0..n0}; param end_0{i in 0..n0}; param start_1{i in 0..n1}; param…
Gioia
  • 81
  • 1
  • 9
0
votes
1 answer

Issue in understanding Multiple Knapsack Problem IBM CPLEX

I found this example in the IBM CPLEX Studio in OPL Examples. However, I am not able to understand these two lines in the program. Is it a special way to use int decision variables instead of boolean? int MaxValue = max(r in Resources)…
Bharadwaj P
  • 1
  • 1
0
votes
2 answers

Error: int object is not iterable, how to resolve this?

def update_basis(A, basis, i, j): for k, var in enumerate(basis): idx = int(var[1:]) if A[i][j] == 1: basis[k] = "x" + str(j+1) break return basis I wrote the above code, and I am getting error as…
huy
  • 176
  • 2
  • 13
0
votes
1 answer

Sample uniformly at random from a simplex in Python

I want to uniformly sample from a simplex in python. I found the following in R but nothing so far in python runif_in_simplex(n, simplex) EDIT: Is the following solution correct? generate N random numbers (N = no of vertices of simplex) Normalize…
RahimEnt
  • 199
  • 1
  • 1
  • 16
0
votes
1 answer

Fast Simplex in R

I am not sure whether this is the right place to ask, but I need to efficiently implement a very large linear programming problem in R (and there is no way around R here). I have tried out some packages like lpSolve but the results seem…
Claudio Moneo
  • 489
  • 1
  • 4
  • 10
1 2 3
…
8 9