Constraint programming is a particular form of optimization modeling that tends to be well-suited for combinatorial models like scheduling and planning.
2
votes
1answer
39 views
Solving programmatically a least squares problem with one constrain
I need to solve the following problem (preferably in python but any other suggestion is welcome)
$$
\min_x||Ax - b||_2
$$
$$
s.t. \: Dx = Dy
$$
everything except x is known. $A$ and $D$ are square ...
1
vote
1answer
58 views
Convex optimization: affine equality constraints into inequality constraints
I have the following problem:
\begin{equation}
\begin{array}{cll}
\displaystyle \min_{ \mathbf{x} } & & \displaystyle f(\mathbf{x}) \\
\mathrm{s.t.} & & \mathbf{x} \in \mathcal{C} \\
...
0
votes
1answer
20 views
Linear Programming : Alternative to summation of absolutes in constraints
I am solving a placement problem, i.e. map $integers\ i\ from\ 0\ to\ 6$ to $(x_i,y_i)\ st\ 1 \le x_i,y_i\le 3$ such that :
$ \sum\limits_{i=0}^6 \sum\limits_{j=0}^6 Cost(i,j)*(|x_i - x_j | + | y_i ...
0
votes
1answer
5 views
Decomposition of chance constraint optimization problem
I want to decompose a chance constraint optimization problem and the constraint is:
$Pr\left( \sum_{i}^{}{\left( x_{i}+\xi _{i} \right)}\leq c \right)\geq 1-\epsilon $
where $\xi _{i}$ are ...
0
votes
0answers
12 views
finding argmax for similarity graph
I am wondering if there is any general method for solving the following combinatorial optimization problem.
Let's suppose that there are m objects and you would like to know what class each object ...
7
votes
3answers
110 views
Is group theory useful in any way to optimization?
For what I have seen, optimization uses a lot of linear algebra and convex analysis, but I have not seen any group theory being used, so I was curious about it.
Is group theory useful in any way to ...
0
votes
0answers
30 views
How to find maximum of $w_1^Ta + w_2^Tb + w_3^Tc$
I have a question that is not homework, but I have gotten nowhere on yet.
Define: $w_1^T := [x_1,\ldots,x_n]$, $w_2^T := [x_1^2,\ldots,x_n^2]$ and $w_3^T := [x_1^3,\ldots,x_n^3]$.
How do I maximise ...
0
votes
1answer
23 views
Computation time
I am implementing a mixed-integer linear programming problem, and I am dealing with an huge number of constraints.
Does anyone know what the linear relation is between the number of constraints of ...
0
votes
0answers
29 views
How to interpret the results of a 2 sample KS-test
I have some data which I want to analyze by fitting a function to it. To do that, I have two functions, one being a gaussian, and one the sum of two gaussians. To test the goodness of these fits, I ...
1
vote
1answer
55 views
Effect of an added constraint to an optimization problem
If you have a constrained maximization problem, and you add an additional constraint, my intuition says that since the new solution space is a subset of the original solution space, the new max ...
3
votes
0answers
42 views
question about the “solvability” of jigsaw sudoku puzzles
I am making a computer program that is going to generate sudoku puzzles of various types. one of these types is "jigsaw", in which the board is split into rows, columns and random 9-square contiguous ...
0
votes
1answer
43 views
psittacism: Fundamental Theory of Time
This question is in reference to the programming question found here.
What method of approach should I be thinking of if I have a list of lectures A, B, and C, and discussions D, E, and F, that are ...
-1
votes
1answer
43 views
The number of ways to get N as the sum of R elements with constraints
The number of ways to get N as the sum of R elements, except my solution must have no repetition (3+2 and 2+3 counts for only 1), and 0 cannot be used.
For example: N=8, R=2, should return 4. The ...
1
vote
0answers
61 views
mathematics of chemical stoichiometry
I would like to better understand the mathematical description of chemical stoichiometry and thermodynamic chemical equilibrium. This problem has many features and I know my description might be too ...
0
votes
0answers
27 views
Absolute Value As a Linear Constraint
I am supposed to write "either $|x_1-x_2|=2$ or $|x_1-x_2|=4$" as a linear constraint, by using binary and continuous variables. So far, I have $|x_1-x_2|=2y$ and $|x_1-x_2|=4(1-y)$, where $y$ is a ...
1
vote
1answer
29 views
organizing rectangles on top of each other
We have some rectangles that should be organized in a number of columns. Each column height should be in the range of $[H, H+d]$ in which $d$ is a small number relative to the height of the ...
