We consider an inverse linear programming (LP) problem in which the parameters in both
the objective function and the constraint set of a given LP problem need to be adjusted as …

This paper aims to consider a type of inverse optimal value problem in second-order conic
programming, in which the parameter in its objective function needs to be adjusted under a …

In this paper, we propose an alternating-direction-type numerical method to solve a class of
inverse semi-definite quadratic programming problems. An explicit solution to one direction …

This paper is devoted to studying a type of inverse second-order cone quadratic
programming problems, in which the parameters in both the objective function and the …

This paper is devoted to the study of solving method for a type of inverse linear semidefinite
programming problem in which both the objective parameter and the right-hand side …

In this paper, we consider a class of sparse inverse semidefinite quadratic programming
problems, in which a nonconvex alternating direction method of multiplier is investigated …

This paper focuses on a type of inverse linear second order cone programming (LSOCP)
problems which require us to adjust the parameters in both the objective function and the …

In inverse scheduling problems, a job sequence is given and the objective is to determine
the minimal perturbation to parameters, such as processing times or weights of jobs so that …

We consider an inverse problem arising from a semidefinite quadratic programming (SDQP)
problem, which is a minimization problem involving l 1 vector norm with positive semidefinite …

We consider in this paper the inverse versions of the two popular problems in location
theory, say the 1-median and the 1-center problems on trees. The cost for modifying vertex …