Questions on proving, manipulating and applying inequalities.

learn more… | top users | synonyms (1)

1
vote
0answers
59 views
+50

When might some a variable leave the basis?

In the simplex algorithm in linear programming, what are conditions for a variable to leave a basis (not necessarily basis for the/an optimal solution)? I'm supposed to list as many sufficient and ...
0
votes
0answers
36 views
+300

When is the inequality $\beta(a_1+b_1, a_2+b_2)\ge \beta(a_1, a_2)\beta(b_1, b_2)$ true?

Let $\beta(a, b) = \frac{\Gamma(a)\Gamma(b)}{\Gamma(a+b)}$. Does there some some general condition on $a_1, a_2, b_1, b_2\in \mathbb{N}^+$ such that $$\beta(a_1+b_1, a_2+b_2)\ge \beta(a_1, ...
4
votes
0answers
76 views
+50

Proof of an inequality in $\mathbb{C}$

Let $z\in \mathbb{C}, n \geq 2$. Show this complex inequality $$|z^n-1|^2\le |z-1|^2\left(1+|z|^2+\dfrac{2}{n-1}\Re{(z)}\right)^{n-1}$$ For $n=2$ the inequality is easy to prove: $$|z^2-1|^2\le ...
0
votes
1answer
86 views
+100

(Elegant) proof of an inequality: $h(x) \geq 1- (1-\frac{x}{1-x})^2$

I am looking for the most concise and elegant proof of the following inequality: $$ h(x) \geq 1- \left(1-\frac{x}{1-x}\right)^2, \qquad \forall x\in(0,1) $$ where $h(x) = x \log_2\frac{1}{x}+(1-x) ...