Coefficient range for a prescribed maximum
Coefficient range for a prescribed maximum
All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T.
- 165 bytes
- COMP mode
Worked examples
Example 1
Original exercise 1. All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T. Data: B=b = 2; C=T = 6; M=N, vertex count = 3; vertex 1: x = 0; vertex 1: y = 0; vertex 2: x = 4; vertex 2: y = 0; vertex 3: x = 0; vertex 3: y = 3.
- (a)Calculate all requested quantities in the stated order. Output order: β: lower bound; β: upper bound.
Answer
Standard solution (without a calculator)
- Build the mathematical model and substitute the data. max f=maxⱼ(βxⱼ+byⱼ); ∃j:xⱼ=0 ∧ byⱼ=T.
- Written solution: x=0 ∧ by=T=6 ⇒ max f≥6.
- x=0: (2)(0)=0≤6; (4)β+(2)(0)≤6 ⇒ β≤3/2; x=0: (2)(3)=6≤6.
- ∀Vⱼ: f(Vⱼ)≤6 ⇒ max f=6; β≤3/2.
- Retain exact fractions in written work; round only the final answer.
Example 2
Original exercise 2. All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T. Data: B=b = 4; C=T = 8; M=N, vertex count = 3; vertex 1: x = -3; vertex 1: y = 0; vertex 2: x = 0; vertex 2: y = 0; vertex 3: x = 0; vertex 3: y = 2.
- (a)Calculate all requested quantities in the stated order. Output order: β: lower bound; β: upper bound.
Answer
Standard solution (without a calculator)
- Build the mathematical model and substitute the data. max f=maxⱼ(βxⱼ+byⱼ); ∃j:xⱼ=0 ∧ byⱼ=T.
- Written solution: x=0 ∧ by=T=8 ⇒ max f≥8.
- (-3)β+(4)(0)≤8 ⇒ β≥-8/3; x=0: (4)(0)=0≤8; x=0: (4)(2)=8≤8.
- ∀Vⱼ: f(Vⱼ)≤8 ⇒ max f=8; β≥-8/3.
- Retain exact fractions in written work; round only the final answer.
Example 3
Original exercise 3. All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T. Data: B=b = 2; C=T = 6; M=N, vertex count = 4; vertex 1: x = -2; vertex 1: y = 1; vertex 2: x = 1; vertex 2: y = 0; vertex 3: x = 2; vertex 3: y = 1; vertex 4: x = 0; vertex 4: y = 3.
- (a)Calculate all requested quantities in the stated order. Output order: β: lower bound; β: upper bound.
Answer
Standard solution (without a calculator)
- Build the mathematical model and substitute the data. max f=maxⱼ(βxⱼ+byⱼ); ∃j:xⱼ=0 ∧ byⱼ=T.
- Written solution: x=0 ∧ by=T=6 ⇒ max f≥6.
- (-2)β+(2)(1)≤6 ⇒ β≥-2; (1)β+(2)(0)≤6 ⇒ β≤6; (2)β+(2)(1)≤6 ⇒ β≤2; x=0: (2)(3)=6≤6.
- ∀Vⱼ: f(Vⱼ)≤6 ⇒ max f=6; -2≤β≤2.
- Retain exact fractions in written work; round only the final answer.
When to use it
All vertices of a nonempty, bounded, closed convex triangle or quadrilateral are given. At least one vertex has x=0 and by=T, so the value T is always attained. Find every β for which the maximum of βx+by throughout the region is exactly T.
Input order
- B=b
- C=T
- M=N, vertex count
- j=1,…,N: xⱼ, yⱼ
- Every displayed input is required unless a blank is explicitly specified. Empty EXE keeps a stored value, whereas typing 0 replaces it with zero. The listed domain conditions must be checked even when the program does not test all of them.
Output order
- β: lower bound
- β: upper bound
- Record the value and press EXE.
- The program has ended. Press AC to leave; EXE runs it again.
Conditions and limitations
- N∈{3,4}; b,T,xⱼ,yⱼ∈ℝ.
- ∃j: xⱼ=0 ∧ byⱼ=T.
- ∀j: βxⱼ+byⱼ≤T.
- Supply all actual vertices of the stated feasible region yourself. The program does not find boundary intersections or verify feasibility, boundedness or convexity. Only a linear objective is covered; curved or empty regions require another method.
- A single 0 means either incompatible constraints or absence of the required x=0 anchor; without that anchor this template is inapplicable and does not prove the general problem has no solution. Two screens 0,0 instead mean the valid interval β=0. −1E99 and 1E99 denote missing lower and upper bounds, not finite coefficients.
- Every displayed input is required unless a blank is explicitly specified. Empty EXE keeps a stored value, whereas typing 0 replaces it with zero. The listed domain conditions must be checked even when the program does not test all of them.
- Use consistent units throughout.
- Finite precision can lose small differences between large numbers or probabilities extremely near 0 or 1. An error marker is never a valid answer.
Checking access…