三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

A Convergence Proof for Constrained Finite Element Solutions

A convergence proof is given for the finite-element solutionof the infinite dimensional quadratic programming problem ofminimizing a quadratic functional subject to linear constraints.The proof for the unconstrained problem is briefly reviewed,and then extended to the constrained case. Only the first partof the proof is given, in which necessary conditions for convergenceare derived for the specific problem and its finite-elementapproximation. The final step of proving that any problem doesobey these conditions will depend on the specific problem, butit is shown that if the finite element formulation is pointwiseconvergent and the unconstrained problem is convergent, thenso too will be the constrained problem.     

轴对称弹塑性扭转问题的数值解

在很多自由边界问题的研究中,变分不等式是一个有力的工具,它不但可以用来研究解的存在唯一性、正则性等理论问题,而且还提供了有效的数值方法(见[1-3]).对轴对称机轴的弹塑性扭转问题,[4,5]用变分不等式研究了解的存在唯一性和正则性,在此基础上,[6]建议用有限元法求解等价的障碍问题.该法的缺点是,事先要解一个一阶非线性偏微分方程的Cauchy问题以求出障碍函数,并且此Cauchy问题的解一般不唯一.本文的方法是直接将原来的变分不等式问题作有限元离散,再将离散问题化成鞍点问题,然后采用Uzawa型算法求解.这就避免了[6]中方法的上述困难.     

A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming

In this paper, we study the bilevel programming problem with discrete polynomial lower level problem. We start by transforming the problem into a bilevel problem comprising a semidefinite program (SDP for short) in the lower level problem. Then, we are able to deduce some conditions of existence of solutions for the original problem. After that, we again change the bilevel problem with SDP in the lower level problem into a semi-infinite program. With the aid of the exchange technique, for simple bilevel programs, an algorithm for computing a global optimal solution is suggested, the convergence is shown, and a numerical example is given.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

On optimal shape design of systems governed by mixed Dirichlet-Signorini boundary value problems

A problem for finding optimal shape for systems governed by the mixed unilateral boundary value problem of Dirichlet-Signorini-type is considered. Conditions for the solvability of the problem are stated when a variational inequality formulation and when a penalty method is used for solving the state problem in question. The asymptotic relation of design problems based on these two formulations is presented. The optimal shape design problem is discretized by means of finite element method. The convergence results for the approximation are proved. The discretized versions are then formulated as a non-linear programming problem. Results of practical computations of the problem in question are reported.     

Reconstruction of boundary regimes in the inverse problem of thermal convection of a high-viscosity fluid

A problem of reconstruction of boundary regimes in a model for free convection of a high-viscosity fluid is considered. A variational method and a quasi-inversion method are suggested for solving the problem in question. The variational method is based on the reduction of the original inverse problem to some equivalent variational minimum problem for an appropriate objective functional and solving this problem by a gradient method. When realizing the gradient method for finding a minimizing element of the objective functional, an iterative process actually reducing the original problem to a series of direct well-posed problems is organized. For the quasi-inversion method, the original differential model is modified by means of introducing special additional differential terms of higher order with small parameters as coefficients. The new perturbed problem is well-posed; this allows one to solve this problem by standard methods. An appropriate choice of small parameters gives an opportunity to obtain acceptable qualitative and quantitative results in solving the inverse problem. A comparison of the methods suggested for solving the inverse problem is made with the use of model examples.     

Coefficient identification in Euler-Bernoulli equation from over-posed data

A method for solving the inverse problem for coefficient identification in the Euler-Bernoulli equation from over-posed data is presented. The original inverse problem is replaced by a minimization problem. The method is applied to the problem for identifying the coefficient in the case when it is a piece-wise polynomial function. Several examples are elaborated and the numerical results confirm that the solution of the imbedding problem coincides with the direct simulation of the original problem within the second order of approximation.     

A branch and bound network approach to the canonical constrained entropy problem

In this paper, we present a branch and bound algorithm for solving the constrained entropy mathematical programming problem. Unlike other methods for solving this problem, our method solves more general problems with inequality constraints. The advantage of the proposed technique is that the relaxed problem solved at each node is a singly constrained network problem. The disadvantage is that the relaxed problem has twice as many variables as the original problem. An application to regional planning is given, and an example problem is solved.     

Algebra complexity problems involving graph homomorphism,semigroups and the constraint satisfaction problem

In this paper, we connect the constraint satisfaction problem with other complexity problems, like the polynomial equivalence problem for combinatorial 0-simple semigroups, the graph retraction problem and the geometry problem. We show that every constraint satisfaction problem is polynomially equivalent to an easily formulated algebra complexity problem. As an application we prove that the polynomial equivalence problem (word problem) for the 2×2 matrices over the two element field is co-NP-complete.     

Single machine stochastic JIT scheduling problem subject to machine breakdowns

In this paper we research the single machine stochastic JIT scheduling problem subject to the machine breakdowns for preemptive-resume and preemptive-repeat.The objective function of the problem is the sum of squared deviations of the job-expected completion times from the due date.For preemptive-resume,we show that the optimal sequence of the SSDE problem is V-shaped with respect to expected processing times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.We discuss the difference between the SSDE problem and the ESSD problem and show that the optimal solution of the SSDE problem is a good approximate optimal solution of the ESSD problem,and the optimal solution of the SSDE problem is an optimal solution of the ESSD problem under some conditions.For preemptive-repeat,the stochastic JIT scheduling problem has not been solved since the variances of the completion times cannot be computed.We replace the ESSD problem by the SSDE problem.We show that the optimal sequence of the SSDE problem is V-shaped with respect to the expected occupying times.And a dynamic programming algorithm with the pseudopolynomial time complexity is given.A new thought is advanced for the research of the preemptive-repeat stochastic JIT scheduling problem.     

Linear optimal control problem for discrete 2-D systems with constraints

Optimal control problem for linear two-dimensional (2-D) discrete systems with mixed constraints is investigated. The problem under consideration is reduced to a linear programming problem in appropriate Hubert space. The main duality relations for this problem is derived such that the optimality conditions for the control problem are specified by using methods of the linear operator theory. Optimality conditions are expressed in terms of solutions for conjugate system.     

Error estimates for shooting methods in two-point boundary value problems for second-order equations

This paper is concerned with a procedure for estimating the global discretization error arising when a boundary value problem for a system of second order differential equations is solved by the simple shooting method, without transforming the original problem in an equivalent first order problem. Expressions of the global discretization error are derived for both linear and nonlinear boundary value problems, which reduce the error estimation for a boundary value problem to that for an initial value problem of same dimension. The procedure extends to second order equations a technique for global error estimation given elsewhere for first order equations. As a practical result the accuracy of the estimates for a second order problem is increased compared with the estimates for the equivalent first order problem.     

State-constrained optimal control of nonlinear elliptic variational inequalities

An optimization control problem for systems described by abstract variational inequalities with state constraints is considered. The solvability of this problem is proved. The problem is approximated by the penalty method. The convergence of this method is proved. Necessary conditions of optimality for the approximation problem are obtained. Its solution is an approximate optimal control of the initial problem.     

Global Method for Monotone Variational Inequality Problems with Inequality Constraints

We consider optimization methods for monotone variational inequality problems with nonlinear inequality constraints. First, we study the mixed complementarity problem based on the original problem. Then, a merit function for the mixed complementarity problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original variational inequality problem is reformulated as simple bounded minimization. Under certain assumptions, we show that any stationary point of the optimization problem is a solution of the problem considered. Finally, we propose a descent method for the variational inequality problem and prove its global convergence.     

MERIT FUNCTION AND GLOBAL ALGORITHM FOR BOX CONSTRAINED VARIATIONAL INEQUALITIES

1 IntroductionWe consider tlie variational inequality problelll, deuoted by VIP(X, F), wliicli is to find avector x* E X such thatF(X*)"(X -- X-) 2 0, VX E X, (1)where F: R" - R" is any vector-valued f11uction and X is a uonelllpty subset of R'.This problem has important applicatiolls. in equilibriun1 modeIs arising in fields such asecououtics, transportatioll scieuce alld operations research. See [1]. There exist mauy lllethodsfor solviug tlie variational li1equality problem VIP(X. …     

Inverse Eigenvalue Problem in Structural Dynamics Design

1 Introduction Structural dynamics design is to design a structure subject to the dynamic characteristics re- quirement, i.e., determine physical and geometrical parameters such that the structure has the given frequencies and (or) mode shapes. This problem often arises in engineering connected with vibration. Recently, Joseph [1], Li et al. [2,3] converted the structural dynamics design to the following inverse eigenvalue problem. GIEP Let x = (x1, , xm)T , and let A(x) and B(x) be real n…     

Split Null Point Problems and Fixed Point Problems for Demicontractive Multivalued Mappings

In this paper, we consider the split null point problem and the fixed point problem for multivalued mappings in Hilbert spaces. We introduce a Halpern-type algorithm for solving the problem for maximal monotone operators and demicontractive multivalued mappings, and establish a strong convergence result under some suitable conditions. Also, we apply our problem of main result to other split problems, that is, the split feasibility problem, the split equilibrium problem, and the split minimization problem. Finally, a numerical result for supporting our main result is also supplied.     

The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes

The exact weighted independent set (EWIS) problem consists in determining whether a given vertex-weighted graph contains an independent set of given weight. This problem is a generalization of two well-known problems, the NP-complete subset sum problem and the strongly NP-hard maximum weight independent set (MWIS) problem. Since the MWIS problem is polynomially solvable for some special graph classes, it is interesting to determine the complexity of this more general EWIS problem for such graph classes.We focus on the class of perfect graphs, which is one of the most general graph classes where the MWIS problem can be solved in polynomial time. It turns out that for certain subclasses of perfect graphs, the EWIS problem is solvable in pseudo-polynomial time, while on some others it remains strongly NP-complete. In particular, we show that the EWIS problem is strongly NP-complete for bipartite graphs of maximum degree three, but solvable in pseudo-polynomial time for cographs, interval graphs and chordal graphs, as well as for some other related graph classes.     

A hybrid method for multidimensional scaling using city-block distances

The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.