Consider the fraction: $$ \frac{|c_1^\top z + b_1|}{c_2^\top z+b_2}$$ where $c_1,c_2 \in \mathbb{R}^n$ and $z \in S=\{x \in \mathbb{R}^n: c_2^\top x +b_2 >0 \}$. What is the supremum of this fraction with respect to $z \in S$ ? Ignore the trivial cases where $c_1=0$ and/or $c_2 = 0$.
2026-04-06 21:14:48.1775510088
upper bound for linear fractional program
117 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INEQUALITY
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Prove or disprove the following inequality
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- Solution to a hard inequality
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Bound for difference between arithmetic and geometric mean
- multiplying the integrands in an inequality of integrals with same limits
- How to prove that $\pi^{e^{\pi^e}}<e^{\pi^{e^{\pi}}}$
- Proving a small inequality
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
Related Questions in LINEAR-PROGRAMMING
- Proving dual convex cone property
- Linear algebra: what is the purpose of passive transformation matrix?
- Building the model for a Linear Programming Problem
- Show that $ \ x_ 0 \ $ cannot be an optimal solution
- Is there any way to model this situation in integer programming?
- How to Solve a Linear Programming Problem in $n$ Dimension Space?
- How to solve a linear program without any given data?
- Constraints for continuous path within graph with at least one obligatory node in path
- Select the smallest strict positive value from a list of variables in a linear program.
- How to add nonnegative constraint to an LP problem
Related Questions in FRACTIONS
- Can we find integers $x$ and $y$ such that $f,g,h$ are strictely positive integers
- How would I simplify this fraction easily?
- Decimal expansion of $\frac{1}{p}$: what is its period?
- To find the Modulus of a complex number
- Tan of difference of two angles given as sum of sines and cosines
- Positive Integer values of a fraction
- What is the range of the function $f(x)=\frac{4x(x^2+1)}{x^2+(x^2+1)^2}$?
- In resticted domain , Applying the Cauchy-Schwarz's inequality
- for $x,y,z\ge 0$, $x+y+z=2$, prove $\frac{x}{1+y^2}+\frac{y}{1+z^2}+\frac{z}{1+x^2}\ge\frac{18}{13}$
- Interesting inequalities
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The task is to maximize$$\rho(\pmb x):=\frac{|\pmb c_1^\top\pmb x+b_1|}{\pmb c_2^\top\pmb x+b_2}$$over $\pmb x\in S:=\{\pmb x\in\Bbb R^n:\pmb c_1^\top\pmb x+b_2>0\}$, where $\pmb c_1$ and $\pmb c_2$ are nonzero. We distinguish the following two cases. In Case 1, $\pmb c_2^\top\pmb x+b_2=0$ implies that $\pmb c_1^\top\pmb x+b_1=0$ for all $\pmb x\in\Bbb R^n$. Otherwise Case 2 holds: that is, there is some $\pmb u\in \Bbb R^n$ such that $$\pmb c_2^\top\pmb u+b_2=0\quad\text{ and }\quad\varepsilon:= |\pmb c_1^\top\pmb u+b_1|>0.$$We deal with Case 1 first. This is when the hyperplane $\{\pmb x\in\Bbb R^n:\pmb c_1^\top\pmb x+b_1=0\}$ is contained within the hyperplane $\{\pmb x\in\Bbb R^n:\pmb c_2^\top\pmb x+b_2=0\}$. Since both hyperplanes have dimension $n-1$, they coincide. Therefore there is some real $\lambda\neq0$ such that $\pmb c_1^\top\pmb x+b_1=\lambda(\pmb c_2^\top\pmb x+b_2)$ for all $\pmb x\in\Bbb R^n$. Thus $\pmb c_1=\lambda\pmb c_2$ and $b_1=\lambda b_2$. Hence $\rho(\pmb x)=|\lambda\pmb c_2^\top\pmb x+\lambda b_2|/|\pmb c_2^\top\pmb x+b_2|=|\lambda|$, and this constant is consequently the supremum (and infimum) of $\rho$.
In the remaining (and general) Case 2, let $\pmb x=\pmb u+\varepsilon\delta\pmb c_2$, where $\delta>0$. Then$$\rho(\pmb x)=\frac{|\pmb c_1^\top\pmb u+b_1+\varepsilon\delta\pmb c_1^\top\pmb c_2|}{\varepsilon\delta\pmb c_2^\top\pmb c_2}\geqslant\frac{|\pmb c_1^\top\pmb u+b_1|-\varepsilon\delta|\pmb c_1^\top\pmb c_2|}{\varepsilon\delta\pmb c_2^\top\pmb c_2}=\frac1{\delta\pmb c_2^\top\pmb c_2}-\frac{|\pmb c_1^\top\pmb c_2|}{\pmb c_2^\top\pmb c_2}.$$By choosing $\delta$ small enough, the above quantity can be made arbitrarily large, and so the supremum of $\rho$ is $\infty$.