In this paper we consider a mathematical program with second-order cone complementarity constraints (SOCMPCC). The SOCMPCC generalizes the mathematical program with complementarity constraints (MPCC) in replacing the set of nonnegative reals by a second-order cone. We show that if the SOCMPCC is considered as an optimization problem with convex cone constraints, then Robinson’s constraint quali...

We consider equality-constrained optimization problems, where a given solution may not satisfy any constraint qualification but satisfies the standard second-order sufficient condition for optimality. Based on local identification of the rank of the constraints degeneracy via the singular-value decomposition, we derive a modified primal-dual optimality system whose solution is locally unique, n...

This paper deals with the formulation of a necessary optimality condition for a topology optimization problem for an elastic contact problem with Tresca friction. In the paper a quasistatic contact model is considered, rather than a stationary one used in the literature. The functional approximating the normal contact stress is chosen as the shape functional. The aim of the topology optimizatio...

This paper deals with the formulation of the necessary optimality condition for a topology optimization problem of an elastic body in unilateral contact with a rigid foundation. In the contact problem of Tresca, a given friction is governed by an elliptic variational inequality of the second order. The optimization problem consists in finding such topology of the domain occupied by the body tha...

The paper establishes that a generalization of Monge–Kantorovich equation gives rise to necessary and sufficient optimality condition for the Kantorovich dual problem minimal flow associated with very degenerate Finsler metric without any assumption on coerciveness.

The coset pattern matrix (CPM) is formally defined as an elaborate characterization of the aliasing patterns of a fractional factorial design. The possibility of using CPM to check design isomorphism is investigated. Despite containing much information about effect aliasing, the CPM fails to determine a design uniquely. We report and discuss small nonisomorphic designs that have equivalent cose...

Moreau-Yosida and Lavrentiev type regularization methods are considered for nonlinear optimal control problems governed by semilinear parabolic equations with bilateral pointwise control and state constraints. The convergence of optimal controls of the regularized problems is studied for regularization parameters tending to infinity or zero, respectively. In particular, the strong convergence o...

In this article we examine to necessary and sufficient optimality conditions for interval optimization problems. We introduce a new concept of stationary point for an interval-valued function based on the gH-derivative. We show the importance the this concept from a practical and computational point of view. We introduce a new concept of invexity for gH-differentiable interval-valued function w...

Optimization via simulation consists in applying iteratively two detached models until an optimality condition is reached: a simulation model for predicting the system performance and an optimization model for finding out the optimal solution. Mathematical programming representation has been recently used to describe the behavior of discrete event systems as well as their formal properties. Thi...

We study a general multiobjective optimization problem with variational inequality, equality, inequality and abstract constraints. Fritz John type necessary optimality conditions involving Mordukhovich coderivatives are derived. They lead to Kuhn-Tucker type necessary optimality conditions under additional constraint qualifications including the calmness condition, the error bound constraint qu...