On feasible sets defined through Chebyshev approximation

On feasible sets defined through Chebyshev approximation

0.00 Avg rating0 Votes
Article ID: iaor19992681
Country: Germany
Volume: 47
Issue: 2
Start Page Number: 255
End Page Number: 264
Publication Date: Jan 1998
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

Let Z be a compact set of the real space ℜ with at least n + 2 points; f, h1, h2 : Z → ℜ continuous function, h1, h2 strictly positive and P(x,z), x := (x0,..., xn)τ ∈ ℜn+1, z ∈ ℜ, a polynomial of degree at most n. Consider a feasible set M := {x ∈ ℜn+1 | ∀z ∈ Z, –h2(z) ≤ P(x,z) – f(z) ≤ h1(z)}. Here it is proved the null vector 0 of n+1 belongs to the compact convex hull of the gradients ± (1,z,..., zn), where z ∈ Z are the index points in which the constraint functions are active for a given x* ∈ M, if and only if M is a singleton.

Reviews

Required fields are marked *. Your email address will not be published.