In this paper we consider problems of the following type: Let E = { e 1 , e 2 ,..., e n } be a finite set and $${\mathcal {F}}$$ be a family of subsets of E. For each element e i in E, c i is a given capacity and $${\mathcal {w}}$$ i is the cost of increasing capacity c i by one unit. It is...

A new smoothing approach was given for solving the mathematical programs with complementarity constraints (MPCC) by using the aggregation technique. As the smoothing parameter tends to zero, if the KKT point sequence generated from the smoothed problems satisfies the second-order necessary...

We consider an inverse quadratic programming (QP) problem in which the parameters in both the objective function and the constraint set of a given QP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear...

Given a networkN=(V,A,c), a sources εV, a. sinkt εV and somes —t cuts and suppose each element of the capacity vectorc can be changed with a cost proportional to the changes, the inverse problem of minimum cuts we study here is to change the original capacities with the least total cost...