关于运输问题最优解的进一步讨论

首先给出了运输问题最优解的相关概念,将最优解扩展到广义范畴,提出狭义多重最优解和广义多重最优解的概念及其区别.然后给出了惟一最优解、多重最优解、广义有限多重最优解、广义无限多重最优解的判定定理及其证明过程.最后推导出了狭义有限多重最优解个数下限和广义有限多重最优解个数上限的计算公式,并举例验证了结论的正确性.     

矩阵方程AXB=D的(R,S)-斜对称解

矩阵方程AXB=D是教学、理论研究和工程实践中常见的一种矩阵方程.给出了AXB=D具有(R,S)-斜对称矩阵解的充分必要条件,及其解存在条件下全体解集合S_X的表达式.此外,还讨论了任意给定矩阵X在仿射子空间S_X中的最优近似解,并给出了最优解的显示表达式.     

广义时间最优控制问题的近似最优解

本文考虑受控系统为Ｖｏｌｔｅｒｒａ积分系统的某种广义时间最优控制问题，导出了近似最优控制的充要条件和存在性结果，并在此基础上给出了一个四步法，可求得广义时间最优控制问题的近似最优解．     

单机排序问题最优解的结构及其求法

本文研究了单机排序问题|r_i=0|∑|c_i-d_i|最优解的结构．提出了最优解的紧密规则，以及最优解的近似求法．     

离散变量结构优化设计的组合算法*

本文首先给出了离散变量优化设计局部最优解的定义,然后提出了一种综合的组合算法.该算法采用分级优化的方法,第一级优化首先采用计算效率很高且经过随机抽样性能实验表明性能较高的启发式算法─—相对差商法,求解离散变量结构优化设计问题近似最优解 X ;第二级采用组合算法,在 X 的离散邻集内建立离散变量结构优化设计问题的(-1,0.1)规划模型,再进一步将其化为(0,1)规划模型,应用定界组合算法或相对差商法求解该(0,1)规划模型,求得局部最优解.解决了采用启发式算法无法判断近似最优解是否为局部最优解这一长期未得到解决的问题,提高了计算精度,同时,由于相对差商法的高效率与高精度,以上综合的组合算法的计算效率也还是较高的.     

矩阵方程A×B=D的(R,S)-斜对称解

矩阵方程A×B=D是教学、理论研究和工程实践中常见的一种矩阵方程.给出了A×B=D具有(R,S)-斜对称矩阵解的充分必要条件,及其解存在条件下全体解集合Sx的表达式.此外,还讨论了任意给定矩阵(X)在仿射子空间Sx中的最优近似解,并给出了最优解的显示表达式.     

低阶精确罚函数的一种二阶光滑逼近

给出了求解约束优化问题的低阶精确罚函数的一种二阶光滑逼近方法,证明了光滑后的罚优化问题的最优解是原约束优化问题的ε-近似最优解,基于光滑后的罚优化问题,提出了求解约束优化问题的一种新的算法,并证明了该算法的收敛性,数值例子表明该算法对于求解约束优化问题是有效的.     

区间数线性规划问题的解法

基于区间数与实数之间的关系,提出了区间数线性规划的激进最优解,保守最优解的定义.利用约束集之间以及目标函数值之间的关系,在原有区间数线性规划的基础之上,给出了两个求解激进最优解、保守最优解的方法.数值例子验证了该方法的有效性和可行性.     

线性规划最优解集的表现

文献［１］讨论了有无穷多最优解的线性规划问题，并利用最优单纯形表格的检验数给出线性规划有无穷多最优解的判别法，本文利用最优基可行解的凸组合及最优极向的非负线性组合给出线性规划最优解集的表现，从而把线性规划最优解集的几何特征阐释清楚．     

广义弧式连通凸锥优化问题的最优性条件及对偶问题

给出了弧式连通凸锥优化问题的强有效解和Benson真有效解的最优性条件,讨论了目标函数和约束函数均为广义弧式连通凸锥函数优化问题的近似有效解的最优性条件,给出了相应的近似Mond-Weir型对偶模型,给出了弱对偶和逆对偶定理.     

数字地震勘探中一种统计建模及求解方法

本文提出了在数字地震勘探技术使用的一种借助于首层折射滑行波特性，来提取表层厚度、速度信息的方法。本文中介绍了该提取方法得出的过程，使用的物理模型及假设，数学原理及近似解法等。本文企盼的是，这个得出过程的启迪示范作用。     

Combining approximate solutions for linear discrete ill-posed problems

Linear discrete ill-posed problems of small to medium size are commonly solved by first computing the singular value decomposition of the matrix and then determining an approximate solution by one of several available numerical methods, such as the truncated singular value decomposition or Tikhonov regularization. The determination of an approximate solution is relatively inexpensive once the singular value decomposition is available. This paper proposes to compute several approximate solutions by standard methods and then extract a new candidate solution from the linear subspace spanned by the available approximate solutions. We also describe how the method may be used for large-scale problems.     

THE NECESSARY AND SUFFICIENT CONDITIONS FOR THE SOLVABILITY OF A CLASS OF THE MATRIX INVERSE PROBLEM

Censider the solutions of the matrix inverse problem, which are symmetric positive semide finite on a subspace. Necessary and sufficient conditions for the solvability, as well as the general solution are obtained. The best approximate solution by the above solution set is given. Thus the open problem in [1] is solved.     

基于DC分解的非凸二次规划SDP近似解

本文提出一类基于DC分解的非凸二次规划问题SDP松弛方法,并通过求解一个二阶锥问题得到原问题的近似最优解.我们首先对非凸二次目标函数进行DC分解,然后利用线性下逼近得到一个凸二次松弛问题,而最优的DC分解可通过求解一个SDP问题得到.数值试验表明,基于DC分解的SDP近似解平均优于经典SDP松弛和随机化方法产生的近似解。     

Near-field and far-field approximations by the Adomian and asymptotic decomposition methods

The Adomian decomposition method and the asymptotic decomposition method give the near-field approximate solution and far-field approximate solution, respectively, for linear and nonlinear differential equations. The Padé approximants give solution continuation of series solutions, but the continuation is usually effective only on some finite domain, and it can not always give the asymptotic behavior as the independent variables approach infinity. We investigate the global approximate solution by matching the near-field approximation derived from the Adomian decomposition method with the far-field approximation derived from the asymptotic decomposition method for linear and nonlinear differential equations. For several examples we find that there exists an overlap between the near-field approximation and the far-field approximation, so we can match them to obtain a global approximate solution. For other nonlinear examples where the series solution from the Adomian decomposition method has a finite convergent domain, we can match the Padé approximant of the near-field approximation with the far-field approximation to obtain a global approximate solution representing the true, entire solution over an infinite domain.     

Best Proximity Points: Optimal Solutions

This article elicits a best proximity point theorem for non-self-proximal contractions. As a consequence, it ascertains the existence of an optimal approximate solution to some equations for which it is plausible that there is no solution. Moreover, an algorithm is exhibited to determine such an optimal approximate solution designated as a best proximity point. It is interesting to observe that the preceding best proximity point theorem includes the famous Banach contraction principle.     

Best Lp approximate solutions of nonlinear integrodifferential equations

In this paper best L_p approximate solutions are shown to exist for a wide class of integrodifferential equations. Using approximation theory techniques, a local existence theorem for solutions is established, and the convergence of the best approximate solutions to a solution is shown.     

Best proximity points: approximation and optimization

A best proximity point theorem explores the existence of an optimal approximate solution, known as a best proximity point, to the equations of the form Tx = x where T is a non-self mapping. The purpose of this article is to establish some best proximity point theorems for non-self non-expansive mappings, non-self Kannan- type mappings and non-self Chatterjea-type mappings, thereby producing optimal approximate solutions to some fixed point equations. Also, algorithms for determining such optimal approximate solutions are furnished in some cases.     

TWO-SCALE FEM FOR ELLIPTIC MIXED BOUNDARY VALUE PROBLEMS WITH SMALL PERIODIC COEFFICIENTS

1. IntroductionComPosite materials have been widely used in high tedrilogy ewineering as well as or-dinary industrial products since they have mW elegat qllallties, such as high strength, bostffeess, high temperature resistance, corrosion resistance, and fatgh resistance. Most of thecomPosite materiaIs have small periodic condgurations. Thu8 the static analysis of the struc-tures of comPosite materials usually leads to the boundary valu Problezns of eiliPtic patialdtherelitial eqllations wi…     

A Spectral Method for Neutral Volterra Integro-Differential Equation with Weakly Singular Kernel

This paper is concerned with obtaining an approximate solution and an approximate derivative of the solution for neutral Volterra integro-differential equation with a weakly singular kernel. The solution of this equation, even for analytic data, is not smooth on the entire interval of integration. The Jacobi collocation discretization is proposed for the given equation. A rigorous analysis of error bound is also provided which theoretically justifies that both the error of approximate solution and the error of approximate derivative of the solution decay exponentially in $L^∞$ norm and weighted $L^2$ norm. Numerical results are presented to demonstrate the effectiveness of the spectral method.