Abstract This paper investigates the set partitioning containing kernels. This problem can also be considered as the identical machine scheduling problem with nonsimultaneous machine release times. That the algorithm ...Abstract This paper investigates the set partitioning containing kernels. This problem can also be considered as the identical machine scheduling problem with nonsimultaneous machine release times. That the algorithm MULTIFIT has a worst case bound of 6/5 is proved. Through combining MULTIFIT and LPT, an algorithm MULTILPT with a worst case bound of 7/6 has been obtained.展开更多
Abstract In this paper,a quasidifferentiable programming problem with inequality constraints is considered.First,a general form of optimality conditions for this problem is given,which contains the results of Luderer,...Abstract In this paper,a quasidifferentiable programming problem with inequality constraints is considered.First,a general form of optimality conditions for this problem is given,which contains the results of Luderer,Kuntz and Scholtes.Next,a new generalized K T condition is derived.The new optimality condition doesnt use Luderers regularity assumption and its Lagrangian multipliers dont depend on the particular elements in the superdifferentials of the object function and constraint functions.Finally,a penalty function for the problem is studied.Sufficient conditions of the penalty function attaining a global minimum are obtained.展开更多
文摘Abstract This paper investigates the set partitioning containing kernels. This problem can also be considered as the identical machine scheduling problem with nonsimultaneous machine release times. That the algorithm MULTIFIT has a worst case bound of 6/5 is proved. Through combining MULTIFIT and LPT, an algorithm MULTILPT with a worst case bound of 7/6 has been obtained.
文摘Abstract In this paper,a quasidifferentiable programming problem with inequality constraints is considered.First,a general form of optimality conditions for this problem is given,which contains the results of Luderer,Kuntz and Scholtes.Next,a new generalized K T condition is derived.The new optimality condition doesnt use Luderers regularity assumption and its Lagrangian multipliers dont depend on the particular elements in the superdifferentials of the object function and constraint functions.Finally,a penalty function for the problem is studied.Sufficient conditions of the penalty function attaining a global minimum are obtained.
