On optimality conditions for vector variational inequalities

Optimality conditions for weak efficient, global efficient and efficient solutions of vector variational inequalities with constraints defined by equality, cone and set constraints are derived. Under various constraint qualifications, necessary optimality conditions for weak efficient, global efficient and efficient solutions in terms of the Clarke and Michel–Penot subdifferentials are established. With assumptions on quasiconvexity of constraint functions sufficient optimality conditions are also given.     

A CONSTRAINT QUALIFICATION FOR CONVEX PROGRAMMING

1. IntroductionLet X be the n-dimensional Euclidean space Rad. Denote the transpose of the columnvector y by yT. Suppose that R7 and nit R= are the n-dimensional vector sets with nonnegative and positive components, whose elements are denoted by y 3 0 and y > 0, respectively.Write R for the nonnegative real number set.Consider a nondiffereatiable convex programming problem:We assume that f(x), gi(x),..', g.(x) are finite reaLvalued continuous, convex functions on X, but not necessarily d…     

A parametric view on the Mangasarian–Fromovitz constraint qualification

The growth of the multipliers, when the parameter approaches such a critical parameter, is characterized by a parametric constraint qualification which is introduced here. It is equivalent to a bound on the growth of the multipliers. Received May 8, 1995 / Revised version received February 12, 1998 Published online February 25, 1999     

Search space pruning and global optimisation of multiple gravity assist spacecraft trajectories

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation. This work was partially funded under the Ariadna scheme of the European Space Agency, contract number 18138/04/NL/MV.     

New Relaxation Method for Mathematical Programs with Complementarity Constraints

In this paper, we present a new relaxation method for mathematical programs with complementarity constraints. Based on the fact that a variational inequality problem defined on a simplex can be represented by a finite number of inequalities, we use an expansive simplex instead of the nonnegative orthant involved in the complementarity constraints. We then remove some inequalities and obtain a standard nonlinear program. We show that the linear independence constraint qualification or the Mangasarian–Fromovitz constraint qualification holds for the relaxed problem under some mild conditions. We consider also a limiting behavior of the relaxed problem. We prove that any accumulation point of stationary points of the relaxed problems is a weakly stationary point of the original problem and that, if the function involved in the complementarity constraints does not vanish at this point, it is C-stationary. We obtain also some sufficient conditions of B-stationarity for a feasible point of the original problem. In particular, some conditions described by the eigenvalues of the Hessian matrices of the Lagrangian functions of the relaxed problems are new and can be verified easily. Our limited numerical experience indicates that the proposed approach is promising.     

Constraint qualifications in multiobjective optimization problems: Differentiable case

In this paper, we are concerned with a multiobjective optimization problem with inequality constraints. We introduce a constraint qualification and derive the Kuhn-Tucker type necessary conditions for efficiency. Moreover, we give conditions which ensure the constraint qualification.This work was done while the author was visiting the University of California, Berkeley, California.     

二项分布下的一种贝叶斯可靠性验收试验方案

为了合理利用先验信息制定可靠性验收试验方案，以降低验收试验的费用，在进行可靠性定型试验的前提下，提出了一种先验信息加工方法，并根据生产与使用双方实际所关心的风险意义，制定了产品可靠性验收试验的一种贝叶斯方案。算例结果证实，该方案在保证了生产方与使用方利益的前提下，减少了试验量，降低了验收试验费用。说明所提出的先验信息利用方式是有效的。     

Hamilton's equations for constrained dynamical systems

We derive expressions for the conjugate momenta and the Hamiltonian for classical dynamical systems subject to holonomic constraints. We give an algorithm for correcting deviations of the constraints arising in numerical solution of the equations of motion. We obtain an explicit expression for the momentum integral for constrained systems.     

A constraint generation algorithm for large scale linear programs using multiple-points separation

In order to solve linear programs with a large number of constraints, constraint generation techniques are often used. In these algorithms, a relaxation of the formulation containing only a subset of the constraints is first solved. Then a separation procedure is called which adds to the relaxation any inequality of the formulation that is violated by the current solution. The process is iterated until no violated inequality can be found. In this paper, we present a separation procedure that uses several points to generate violated constraints. The complexity of this separation procedure and of some related problems is studied. Also, preliminary computational results about the advantages of using multiple-points separation procedures over traditional separation procedures are given for random linear programs and survivable network design. They illustrate that, for some specific families of linear programs, multiple-points separation can be computationally effective.     

A new approach for dynamic analysis of flexible manipulator systems

In this paper, a new approach for dynamic analysis of the flexible multibody manipulator systems is described. The organization of the computer implementations which are used to automatically construct and numerically solve the system of loosely coupled dynamic equations expressed in terms of the absolute, joint and elastic coordinates is discussed. The main processor source code consists of three main modules: constraint module, mass module and force module. The constraint module is used to numerically evaluate the relationship between the absolute and joint accelerations. The mass module is used to numerically evaluate the system mass matrix as well as the non-linear Coriolis and centrifugal forces associated with the absolute, joint and elastic coordinates. At the same time, the force module is used to numerically evaluate the generalized external and elastic forces associated with the absolute, joint and elastic coordinates. Computational efficiency is achieved by taking advantage of the structure of the resulting system of loosely coupled equations. The absolute, joint and elastic accelerations are integrated forward in time using direct numerical integration methods. The absolute positions and velocities can then be determined using the kinematic relationships. The flexible 2-DOF double-pendulum and spatial manipulator systems are used as illustrated examples to demonstrate and verify the application of the computational procedures discussed in this paper.