Some results on regularity in vector optimization

In this paper we suggest an approach to regularity in, vector optimization which extends the one given in [9]; some necessary or sufficient regularity conditions are given for a wide class of nondifferentiable vector optimization problems which embraces the convex ones.     

Constraint-Based Representations of Statistical Graphs

Abstract

Pictor is an environment for statistical graphics that promotes simple commands for common uses and offers the ability to experiment with whole new paradigms. Pictor describes graphs as graphical objects whose component pieces are related by several sorts of constraints. This article describes in detail the constraint system that Pictor uses.     

Faddeev-Jackiw and the improved methods in quantization of the superconductive system

In this paper, we give the overview on Faddeev-Jackiw method and its improved one, as well as the relative studies recently and realize quantization of the superconductive system by the two methods, we get the same results by the two disposal methods. Furthermore, at convenience of the familiar study in this system, we take it as the application example and compare the two methods by dealing with this system from different aspects, demonstrate the improved Faddeev-Jackiw method is effective and significative, and represent the superiorities of the improved Faddeev-Jackiw method. We show that the improved method may simplify investigations of different complicated constrained systems.     

带模糊约束的最小费用流问题

本文首次提出了带模糊约束的最小费用流问题,建立了相应的数学模型并给出了求解这一模型的有关算法。最后,给出了一个具体实例。     

Characterization of Standard Reference Material 2942, Ce-ion-doped glass, spectral correction standard for UV fluorescence

Standard Reference Material (SRM) 2942 is a cuvette-shaped, Ce-ion-doped glass, recommended for use for relative spectral correction of emission from 320 to 430 nm and day-to-day performance verification of steady-state fluorescence spectrometers. Properties of this standard that influence its effective use or contribute to the uncertainty in its certified emission spectrum were explored here. These properties include its photostability, absorbance, dissolution rate in water, anisotropy and temperature coefficient of fluorescence intensity. The expanded uncertainties in the certified spectrum are about 9% around the peak maximum at 330 nm, using an excitation wavelength of 310 nm. The SRM also exhibits a strong resistance to photodegradation, with no measurable decrease in fluorescence intensity even after 25 h of irradiation with UV light>280 nm from a Xe lamp.     

Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications

We consider a class of optimization problems that is called a mathematical program with vanishing constraints (MPVC for short). This class has some similarities to mathematical programs with equilibrium constraints (MPECs for short), and typically violates standard constraint qualifications, hence the well-known Karush-Kuhn-Tucker conditions do not provide necessary optimality criteria. In order to obtain reasonable first order conditions under very weak assumptions, we introduce several MPVC-tailored constraint qualifications, discuss their relation, and prove an optimality condition which may be viewed as the counterpart of what is called M-stationarity in the MPEC-field.     

A time-stepping procedure based on convolution for the mixed finite element approximation for porous media flow

A time-stepping procedure is established and analyzed for the problem of miscible displacement in porous medium. The fluid velocity based on mixed element method is post-processed by the convolution with Bramble-Schatz kernel. Convergence analysis shows that the property of superconvergence, originally held for the approximation of velocity, can be retained for the approximation of concentration variable. Compared with the traditional results in references, the constraint conditions between parameters in this paper are improved essentially.     

Optimization models for the single delay management problem in public transportation

Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the reliability of connections between vehicles is a key issue for the attractiveness of the intermodal transportation network and it is strongly affected by some unpredictable events like breakdowns or vehicle delays. In such cases, a decision is required to determine if the connected vehicles should wait for the delayed ones or keep their schedule. The delay management problem (DMP) consists in defining the wait/depart policy which minimizes the total delay on the network. In this work, we present two equivalent mixed integer linear programming models for the DMP with a single initial delay, able to reduce the number of variables with respect to the formulations proposed by the literature. The two models are solved by a branch and cut procedure and by a constraint generation approach respectively, and preliminary computational results are presented.     

On strong and total Lagrange duality for convex optimization problems

We give some necessary and sufficient conditions which completely characterize the strong and total Lagrange duality, respectively, for convex optimization problems in separated locally convex spaces. We also prove similar statements for the problems obtained by perturbing the objective functions of the primal problems by arbitrary linear functionals. In the particular case when we deal with convex optimization problems having infinitely many convex inequalities as constraints the conditions we work with turn into the so-called Farkas-Minkowski and locally Farkas-Minkowski conditions for systems of convex inequalities, recently used in the literature. Moreover, we show that our new results extend some existing ones in the literature.     

On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets

In the paper, we consider a problem of convex Semi-Infinite Programming with an infinite index set in the form of a convex polyhedron. In study of this problem, we apply the approach suggested in our recent paper [Kostyukova OI, Tchemisova TV. Sufficient optimality conditions for convex Semi Infinite Programming. Optim. Methods Softw. 2010;25:279–297], and based on the notions of immobile indices and their immobility orders. The main result of the paper consists in explicit optimality conditions that do not use constraint qualifications and have the form of criterion. The comparison of the new optimality conditions with other known results is provided.