Dec 29, 2015 22:53
@ErwinKalvelagen So do we write this equation : $ 4x_1-x_2-x_6=1$ as $ 4x_1-x_2-x_6+x_8=1$, then apply the simplex method using the following matrix
$A=\begin{bmatrix}
3 & 2 &-1 & 1 & 0 & 0 & 0 & 0\\
0 & 5 & -1 & 0 & 1 & 0 & 0 & 0\\
4 & -1 & 0 & 0 & 0 & -1 &0 & 1 \\
1 & 1 &1 & 0 & 0 & 0 & 1 & 0
\end{bmatrix}$

and then at the optimal solution that we find we just ignore the last component?

Or have I understood it wrong?
Dec 29, 2015 22:46
@ErwinKalvelagen Ah I found it in my textbook... I will read it now and I'll tell you if I got it... :)
Dec 29, 2015 22:39
Could you explain to me what we do in "phase 1" simplex method ? @ErwinKalvelagen
Dec 29, 2015 22:34
Ok, I will look at it... But in class we didn't fo this... @ErwinKalvelagen
So if we want to find an initial solution do we have to make gauss elimination or something similar? @ErwinKalvelagen
Dec 29, 2015 22:27
How can we find an initial basic feasible non-degenerate solution so that we can apply the simplex method now that we have -1 at the P_6 column? @ErwinKalvelagen
Dec 29, 2015 22:27
$A=\begin{bmatrix}
3 & 2 &-1 & 1 & 0 & 0 & 0\\
0 & 5 & -1 & 0 & 1 & 0 & 0\\
4 & -1 & 0 & 0 & 0 & -1 &0 \\
1 & 1 &1 & 0 & 0 & 0 & 1
\end{bmatrix}$
Dec 29, 2015 22:25
The matrix A that corresponds to the above equations is the following:
Dec 29, 2015 22:25
$$- \max (-3x_1+x_2-2x_3) \\ 3x_1+2x_2-x_3+x_4 = 9 \\ 5x_2-x_3+x_5 =1 \\ 4x_1-x_2-x_6=1 \\ x_1+x_2+x_3+x_7= 3 \\ x_i \geq 0, i=1, \dots, 7$$
Dec 29, 2015 22:24
I wrote it in its canonical form as follows:
Dec 29, 2015 22:24
$$\min (3x_1-x_2+2x_3) \\ 3x_1+2x_2-x_3 \leq 9 \\ 5x_2-x_3 \leq 1 \\ 4x_1-x_2 \geq 1 \\ x_1+x_2+x_3 \leq 3 \\ x_1, x_2, x_3 \geq 0$$
Dec 29, 2015 22:22
@ErwinKalvelagen I want to solve the following linear programming problem:
Dec 29, 2015 22:21
Could I ask you something about the simplex method?
Dec 29, 2015 22:20
Hi @Erwin Kalvelagen !!!
 

 Computer Science

General discussion for cs.stackexchange.com
Dec 27, 2015 22:31
Do you have an idea?
Dec 27, 2015 21:48
@EvilJS
Dec 27, 2015 21:48
Dec 27, 2015 19:22
@EvilJS This is my question:
Dec 26, 2015 21:37
Hello!!! Are you famiiar with the simplex method?
 

 Mathematics

Associated with Math.SE; for both general discussion & math qu...
Dec 27, 2015 20:04
@Semiclassical I see... But can this be used? I wrote the problem in its canonical form...
Dec 27, 2015 19:37
Guten Abend @TedShifrin
Dec 27, 2015 19:22
Aa... I have written my question above... Did you take a look at it?
Dec 27, 2015 19:21
Hi @robjohn
Are you maybe familiar with the simplex method?
Dec 27, 2015 19:21
A ok... no problem.... @Semiclassical
Dec 27, 2015 19:19
@Semiclassical Are you familiar with the simplex method? I have written my question above...
Dec 27, 2015 19:18
Dec 27, 2015 19:17
Hi @Semiclassical
Dec 26, 2015 21:42
Is there a way that I could check if the solution is the right one? @BenjaminLindqvist
Dec 26, 2015 21:40
@BenjaminLindqvist I want to solve the linear programming problem:
$\max (5x_1-4x_2) \\ -x_1+x_2 \geq -6 \\ 3x_1-2x_2 \leq 24 \\ -2x_1+3x_2 \leq 9 \\ x_1, x_2 \geq 0$

I have found that the solution is $(0, \frac{6}{5}, \frac{36}{5},0, \frac{99}{5})$.. Am I right?
Dec 26, 2015 21:33
Hello!!! Is anyone of you familiar with the simplex method?
Dec 23, 2015 18:18
@Jake1234 Why is it like that? Could you explain it to me?
Dec 23, 2015 18:12
@Jake1234 Anyway... thanks for answering...
Dec 23, 2015 18:11
@Jake1234 I don't know... It is not written something about it. I wanted to understand why the set of feasible solution can be unbounded and closed, but now looking at the proof that the set is closed I saw that we don't use the boundness or not of F, but only that A (Ax=b) is continuous.
Dec 23, 2015 18:07
@Jake1234 So you mean that it is not closed? We call the set F and it's the set of feasible solutions of a linear programming in caconical form.
Dec 23, 2015 17:53
Dec 23, 2015 17:52
Hello!!!
@DanielFischer According to my notes the following set (where I drawed the lines) is closed and unbounded. Could you explain me why it is closed?
Dec 22, 2015 18:34
Yes, I am sorry... I don't know what I wrote wrong.. Thank you!!! @DanielFischer
Dec 22, 2015 17:46
@DanielFischer Hey!!! Let $A: \mathbb{R}^n \to \mathbb{R}^n \\ A(x_1, x_2, \dots)=(a_1 x_1, a_2 x_2, \dots)$. In order to show that A is a linear mapping is the following sufficient?
Let $x=(x_1, x_2, \dots), y=(y_1, y_2, \dots) \in \ell^2(\mathbb{N}), \lambda, \mu \in \mathbb{R}$. $A(\lambda x+ \mu y)=(a_1(\lambda x_1+ \mu y_1), a_2 (\lambda x_2+ \mu y_2), \dots)=(\lambda a_1 x_1+ \mu a_1 y_1, \lambda a_2 x_2+ \mu a_2 x_2, \dots)=\lambda (a_1 x_1, a_2 x_2, \dots)+ \mu (a_1 y_1, a_2 y_2, \dots)= \lambda Ax+ \lambda Ay$
Dec 21, 2015 11:37
@DanielFischer A ok... It is dynamic programming...
Dec 21, 2015 11:08
Hello @DanielFischer !!!
I am looking at the following:
The nodes $A,B,C,D,E,F,G,H,I$ are given and are related as follows:
http://www.directupload.net/file/d/4209/fiinaajz_png.htm
The nodes $B,C,D,E,F,G,H,I$ are tasks that are done so that a work is completed , for example a building, and the cost $p(a,b)$ are the days that are needed so that the work $b$ finishes if the work $a$ has already finished.
For example, $p(A,B)=22$: 22 days are needed so that the work B is done.
$p(B,E)$: 16 days are needed so that the work E is done if the work B has finished.
Dec 19, 2015 22:39
Yes.

For each $m,n$ with $m>n-1$ we have $\sum_{k=n}^m x_k^2= \sum_{k=1}^m x_k^2- \sum_{k=1}^{n-1} x_k^2$.
We fix n and let m tend to $+\infty$: $\sum_{k=n}^{\infty} x_k^2= \sum_{k=1}^{\infty}x_k^2- \sum_{k=1}^{n-1} x_k^2$.

While $n \to +\infty$: $\lim_{n \to +\infty} \sum_{k=n}^{\infty} x_k^2= \sum_{k=1}^{\infty} x_k^2- \sum_{k=1}^{\infty} x_k^2=0$. Right?
Dec 19, 2015 22:29
@DanielFischer That it converges to 0, while $n \to +\infty$ and that's why $||T^n x|| \to 0, \forall x \in \ell^2(\mathbb{N})$ ?
Dec 19, 2015 22:25
@DanielFischer It holds that $||T^n x||_2=\sqrt{x_n^2+ x_{n+1}^2+ \dots}$. How can we deduce that this converges to 0?
Dec 19, 2015 22:19
@DanielFischer We have the linear mapping $T: \ell^2 (\mathbb{N}) \to \ell^2(\mathbb{N})$ with $T(x_1, x_2, x_3, \dots)=(x_2, x_3, \dots)$
I have shown that $||T^n||=1 \forall n=1,2, \dots$ as follows:

We notice that:
$T^2(x_1, x_2, \dots)=(x_2, x_3, \dots), T^3(x_1, x_2, \dots)=(x_3, x_4, \dots), \dots, T^n(x_1, x_2, \dots)=(x_n, x_{n+1}, \dots)$

Since $x \in \ell^2(\mathbb{N}), ||T^n||= \sup \{ ||T^n x||: ||x||_2=1\}=1$

But then I have to show that $||T^n x||_2 \to 0 \forall x \in \ell^2(\mathbb{N})$.
Dec 19, 2015 20:06
@DanielFischer So do we consider that $|ax_1+bx_2|= \langle (a,b), (x_1, x_2) \rangle$?
Dec 19, 2015 19:51
@DanielFischer I have also an other question.
We consider the linear mapping $T: \mathbb{R}^2 \to \mathbb{R}^2$ with $T(x_1, x_2)=(ax_1+bx_2, cx_1+dx_2), (x_1, x_2) \in \mathbb{R}^2$, where $a,b,c,d$ are given real numbers such that $|a|+|b|+|c|+|d| \neq 0$.
I want to show that the set $\{ M>0: ||T(x_1, x_2)||_2 \leq M ||(x_1, x_2)||_2 \forall (x_1, x_2) \in \mathbb{R}^2 \}$ is non-empty.

The following answer is given: $||T(x_1,x_2)||_2 \overset{\text{Cauchy-Scharz}}{\leq} \sqrt{a^2+b^2+c^2+d^2} ||(x_1,x_2)||_2 \forall (x_1,x_2) \in \mathbb{R}^2$.
Dec 19, 2015 19:42
Ok, I will think about it again.... @DanielFischer
Thank you!!!
 
Dec 21, 2015 18:31
Yes...@ThomasKlimpel
Dec 21, 2015 14:26
It is given a graph and I want to find the shortest path..And I wanted to vrify if the way I did it is right... @ThomasKlimpel
Dec 21, 2015 12:07
Are you familiar with dynamic programming?
Dec 21, 2015 12:06
Hello @ThomasKlimpel !!!