in many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. this paper defines a new inverse problem, called “inverse feasible problem”. for a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.

We solve the inverse problem from the spectral measure and the inverse three-spectra problem for the class of singular Krein strings on a finite interval with trace class resolvents. In particular, this includes a complete description of all possible spectral measures and three (Dirichlet) spectra associated with this class of Krein strings. The solutions of these inverse problems are obtained ...

An inverse eigenvalue problem concerns the reconstruction of a structured matrix from prescribed spectral data. Such an inverse problem arises in many applications where parameters of a certain physical system are to be determined from the knowledge or expectation of its dynamical behavior. Spectral information is entailed because the dynamical behavior often is governed by the underlying natur...

In this note, we solve an inverse spectral problem for a class of finite band symmetric matrices. We provide necessary and sufficient conditions for a matrix valued function to be a spectral function of the operator corresponding to a matrix in our class and give an algorithm for recovering this matrix from the spectral function. The reconstructive algorithm is applicable to matrices which cann...

In this paper, for the first time, we study inverse Sturm–Liouville problem with polynomials of spectral parameter in boundary condition and entire analytic functions second one. For investigation new problem, develop an approach based on construction a special vector functional sequence suitable Hilbert space. The uniqueness recovering potential from part spectrum is proved. Furthermore, our m...