An entropy function (or refered to as K-S function or envelop function) based algorithm for min-max problems with equality and/or inequality constraints are established. We prove that any cluster of the K-T points of the approximation problems is a critical point of the original problem if the constraints of the original problem satisfy Mangnsarian-Fromovitz constraint qualification at the cluster point. Numericalare also given.
展开▼
