We consider a nonsmooth semi-infinite interval-valued vector programming problem, where the objectives and constraint functions need not to be locally Lipschitz. Using Abadie’s qualification convexificators, we provide Karush–Kuhn–Tucker necessary optimality conditions by converting initial problem into bi-criteria optimization problem. Furthermore, establish sufficient under asymptotic convexi...

We consider a manufacturer using a Request For Quotes reverse auction in combination with supplier qualification screening to determine which qualified supplier will be awarded a contract. Supplier qualification screening is costly for the manufacturer, for example involving reference checks, financial audits, and on-site visits. The manufacturer seeks to minimize its total procurement costs, i...

A solution of the standard formulation of a linear program with linear complementarity constraints (LPCC) does not satisfy a constraint qualification. A family of relaxations of an LPCC, associated with a probability-one homotopy map, proposed here is shown to have several desirable properties. The homotopy map is nonlinear, replacing all the constraints with nonlinear relaxations of NCP functi...

We consider the generalized Nash equilibrium problem (GNEP), where not only the players’ cost functions but also their strategy spaces depend on the rivals’ decision variables. Existence results for GNEPs are typically shown by using a fixed point argument for a certain set-valued function. Here we use a regularization of this set-valued function in order to obtain a single-valued function that...

The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are within radio range and the positions of a subset of the sensors (called anchors). Current solution techniques relax this problem to a weighted, nearest, (positive) semidefinite programming, SDP , completion problem, by...

Uncertainty in Logic Programming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. This report is intended as a first step towards the investigation of qualified computations in Constraint Functional Logic Programming, including uncertain computations as a particular case. We revise an early proposal, namely va...

We present a new relaxation scheme for mathematical programs with equilibrium constraints (MPEC), where the complementarity constraints are replaced by a reformulation that is exact for the complementarity conditions corresponding to sufficiently non-degenerate complementarity components and relaxes only the remaining complementarity conditions. A positive parameter determines to what extent th...

In this paper, we perform sensitivity analysis of the value function for parametric mathematical programs with equilibrium constraints (MPEC). We show that the value function is directionally differentiable in every direction under the MPEC relaxed constant rank regularity condition, the MPEC no nonzero abnormal multiplier constraint qualification, and the restricted inf-compactness condition. ...

To appear in Theory and Practice of Logic Programming (TPLP) Uncertainty in logic programming has been widely investigated in the last decades, leading to multiple extensions of the classical LP paradigm. However, few of these are designed as extensions of the well-established and powerful CLP scheme for Constraint Logic Programming. In a previous work we have proposed the SQCLP (proximity-base...

In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential optimality conditions for multiobjective optimization problems with equality and inequality constraints without any constraint qualifications introduce a weak qualification which assures the equivalence between SCAKKT Karush-Kuhn-Tucker (J Optim Theory Appl 80 (3): 483-500, 1994) problems.