A note on the separation of subtour elimination constraints in elementary shortest path problems

This note proposes an alternative procedure for identifying violated subtour elimination constraints (SECs) in branch-and-cut algorithms for elementary shortest path problems. The procedure is also applicable to other routing problems, such as variants of travelling salesman or shortest Hamiltonian path problems, on directed graphs. The proposed procedure is based on computing the strong components of the support graph. The procedure possesses a better worst-case time complexity than the standard way of separating SECs, which uses maximum flow algorithms, and is easier to implement.     

基于改进NAS-RIF的三维显微图像盲复原

对二维NAS-RIF算法进行了改进,并将它用于三维显微图像复原,分别用模拟样本和真实生物样本进行了实验。针对原算法对噪声有放大作用,提出了基于中值滤波去噪的改进。在支持域的确定、最小点的搜索上进行改进,提高复原质量。改进了原算法仅适用于均匀背景的不足,扩大了应用范围。实验结果表明,该算法在三维显微图像盲复原中具有较好的效果。     

Order acceptance and scheduling with machine availability constraints

We consider an order acceptance and scheduling model with machine availability constraints. The manufacturer (machine) is assumed to be available to process orders only within a number of discontinuous time intervals. To capture the real-life behavior of a typical manufacturer who has restrictions of time availability to process orders, our model allows the manufacturer to reject or outsource some of the orders. When an order is rejected or outsourced, an order-dependent cost of penalty will occur. The objective is to minimize the makespan of all accepted orders plus the total penalty of all rejected/outsourced orders. We study the approximability of the model and some of its important special cases.     

Closed-Loop Control of the Motion of a Disk–Rod System

This work deals with the guidance and control of a system which is composed of a rolling disk and a controlled slender rod that is pivoted, through its center of mass, about the disk center. There are given N points P _i, i=1, ..., N, in the horizontal plane, a set of angles _2i , i=1, ..., N, a finite-time interval [0, t _f], and a sequence of times ₁=0<₂<...< _N =t _f. Using the concept of path controllability, a closed-loop control law is derived to steer the system in such a manner that the disk center and the rod angle of rotation ₂ will pass through (P _i, _2i ) at the times _i , i=1,...,N, respectively. This system serves as a model for the motion of a simple mobile robot.     

Weak and strong stationarity in generalized bilevel programming and bilevel optimal control

In this article, we consider a general bilevel programming problem in reflexive Banach spaces with a convex lower level problem. In order to derive necessary optimality conditions for the bilevel problem, it is transferred to a mathematical program with complementarity constraints (MPCC). We introduce a notion of weak stationarity and exploit the concept of strong stationarity for MPCCs in reflexive Banach spaces, recently developed by the second author, and we apply these concepts to the reformulated bilevel programming problem. Constraint qualifications are presented, which ensure that local optimal solutions satisfy the weak and strong stationarity conditions. Finally, we discuss a certain bilevel optimal control problem by means of the developed theory. Its weak and strong stationarity conditions of Pontryagin-type and some controllability assumptions ensuring strong stationarity of any local optimal solution are presented.     

A sharp uniqueness result for a class of variational problems solved by a distance function

We consider the minimization problem for an integral functional J, possibly nonconvex and noncoercive in , where is a bounded smooth set. We prove sufficient conditions in order to guarantee that a suitable Minkowski distance is a minimizer of J. The main result is a necessary and sufficient condition in order to have the uniqueness of the minimizer. We show some application to the uniqueness of the solution of a system of PDEs of Monge–Kantorovich type arising in problems of mass transfer theory.     

Necessary Conditions in Multiobjective Optimization with Equilibrium Constraints

We study multiobjective optimization problems with equilibrium constraints (MOPECs) described by parametric generalized equations in the form

On sharp necessary optimality conditions in control of contact problems with strings

The paper deals with necessary optimality conditions in a special infinite-dimensional mathematical program with equilibrium constraints having a mechanical interpretation. The main hurdle consists in the computation of the limiting normal cone to the graph of the normal-cone mapping _ND(⋅)$N_D(\cdot )$, where D$D$ is the cone of nonnegative functions in the Sobolev space considered. We discuss also the influence of state and mixed control–state constraints.     

Second-Order Necessary Optimality Conditions for Some State-Constrained Control Problems of Semilinear Elliptic Equations

In this paper we are concerned with some optimal control problems governed by semilinear elliptic equations. The case of a boundary control is studied. We consider pointwise constraints on the control and a finite number of equality and inequality constraints on the state. The goal is to derive first- and second-order optimality conditions satisfied by locally optimal solutions of the problem. Accepted 6 May 1997