In this paper, we study a class of optimization problems, called Mathematical Programs with Cardinality Constraints (MPCaC). This kind problem is generally difficult to deal with, because it involves constraint that not continuous neither convex, but provides sparse solutions. Thereby reformulate MPCaC in suitable way, by modeling as mixed-integer and then addressing its counterpart, which will...

It is well known that the duality theory for linear programming (LP) is powerful and elegant and lies behind algorithms such as simplex and interior-point methods. However, the standard Lagrangian for nonlinear programs requires constraint qualifications to avoid duality gaps. Semidefinite linear programming (SDP) is a generalization of LP where the nonnegativity constraints are replaced by a s...

In this paper, we study a semi-infinite programming (SIP) problem with a convex set constraint. Using the value function of the lower level problem, we reformulate SIP problem as a nonsmooth optimization problem. Using the theory of nonsmooth Lagrange multiplier rules and Danskin’s theorem, we present constraint qualifications and necessary optimality conditions. We propose a new numerical meth...

We develop a new notion of second-order complementarity with respect to the tangent subspace associated to second-order necessary optimality conditions by the introduction of so-called tangent multipliers. We prove that around a local minimizer, a second-order stationarity residual can be driven to zero while controlling the growth of Lagrange multipliers and tangent multipliers, which gives a ...

Assigning nursing staff to specific duties according to their contract, qualifications, skills, etc. within a working environment characterised by multi-disciplinarity and statutory regulations is problematic. Factors involved in making effective assignments include individual and corporate procedures, guidelines and constraints. Manual rostering commonly proceeds through a process of reasoning...

Assigning staff to specific duties according to their contract, qualifications, skills, etc. within a working environment characterised by multi-disciplinarity and statutory regulations is problematic. This paper discusses an approach to nurse rostering, using a strategy of distributing the computational effort required in the scheduling process. The technique involves a hybrid approach that de...

We introduce two new weaker Constraint Qualifications (CQs) for mathematical programs with equilibrium (or complementarity) constraints, MPEC for short. One of them is a tailored version of the constant rank of subspace component (CRSC) and the other is a relaxed version of the MPECNo Nonzero Abnormal Multiplier Constraint Qualification (MPEC-NNAMCQ). Both incorporate the exact set of gradients...

Mathematical programming methods have traditionally been used extensively in the analysis and design of elastic/plastic structures. However, some of the recent results from parametric nonlinear programming have not been fully exploited in mechanical applications, particularly those relating to the causes of singularities due to parametric variations. In this paper, we reexamine the phenomenon o...

Abstract. We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-Fromovitz constraint qualifications are satisfied, but the active constraint gradients are not necessarily linearly independent. When a strict complementarity condition is satisfied, we show uniqueness of the lo...