In a mathematical program with generalized complementarity constraints(MPGCC),complementarity relation is imposed between each pair of variable *** includes the traditional mathematical program with complementarity co...
详细信息
In a mathematical program with generalized complementarity constraints(MPGCC),complementarity relation is imposed between each pair of variable *** includes the traditional mathematical program with complementarity constraints(MPCC)as a special *** account of the disjunctive feasible region,MPCC and MPGCC are generally difficult to *** l_(1)penalty method,often adopted in computation,opens a way of circumventing the *** it remains unclear about the exactness of the l_(1)penalty function,namely,whether there exists a sufficiently large penalty parameter so that the penalty problem shares the optimal solution set with the original *** this paper,we consider a class of MPGCCs that are of multi-affineobjective *** problem class finds applications in various fields,e.g.,the multi-marginal optimal transport problems in many-body quantum physics and the pricing problems in network *** first provide an instance from this class,the exactness of whose l_(1)penalty function cannot be derived by existing *** then establish the exactness results under rather mild *** results cover those existing ones for MPCC and apply to multi-block contexts.
暂无评论