Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems

We derive conditions for the local uniqueness of solutions of nonlinear complementarity problems (NCP). We then prove the existence, continuity, and directional differentiability of a locally unique parametric solution of the parametric NCP under stronger assumptions. In the absence of degeneracy this parametric solution is also shown to be continuously differentiable.     

上半平面中含参变未知函数的Hilbert边值问题

给出了上半平面中的含参变未知函数的Hilbert边值问题的提法,利用函数的对称扩张,将其转化为无穷直线上含参变未知函数的Riemann边值问题,得到了该问题的一般解和可解性定理.     

Well-posedness for general parametric quasi-variational inclusion problems

In this paper, we aim to suggest the new concept of well-posedness for the general parametric quasi-variational inclusion problems (QVIP). The corresponding concepts of well-posedness in the generalized sense are also introduced and investigated for QVIP. Some metric characterizations of well-posedness for QVIP are given. We prove that under suitable conditions, the well-posedness is equivalent to the existence of uniqueness of solutions. As applications, we obtain immediately some results of well-posedness for the parametric quasi-variational inclusion problems, parametric vector quasi-equilibrium problems and parametric quasi-equilibrium problems.     

New Uniform Parametric Error Bounds

A uniform parametric error bound is a uniform error estimate for feasible solutions of a family of parametric mathematical programming problems. It has been proven useful in exact penalty formulation for bilevel programming problems. In this paper, we derive new sufficient conditions for the existence of uniform parametric error bounds.     

两阶段主从博弈均衡解的存在性

首先给出带参数的纳什均衡问题Γ(x),在此基础上给出了具有带参数的纳什均衡约束的两阶段主从博弈问题G.可以证明带参数的纳什均衡点是存在的,即无论领导者选择何种策略,跟随者的最佳回应集都是非空的.最后推出了关于两阶段主从博弈均衡点的存在性定理.     

An O(n) algorithm for quadratic knapsack problems

An algorithm is presented which solves bounded quadratic optimization problems with n variables and one linear constraint in at most O(n) steps. The algorithm is based on a parametric approach combined with well-known ideas for constructing efficient algorithms. It improves an O(n log n) algorithm which has been developed for a more restricted case of the problem.     

Minimal Networks on the Regular n-Dimensional Simplex

The paper gives the proof of the following fact: all simple, i.e., having no nodes of degree 2, trees that span the vertices of the regular n-dimensional simplex can be realized as nondegenerate minimal parametric networks.     

Prescribed Mean Curvature Hypersurfaces in Hn+1(-1) with Convex Planar Boundary, I

We study immersed prescribed mean curvature compact hypersurfaces with boundary in Hⁿ⁺¹(-1). When the boundary is a convex planar smooth manifold with all principal curvatures greater than 1, we solve a nonparametric Dirichlet problem and use this, together with a general flux formula, to prove a parametric uniqueness result, in the class of all immersed compact hypersurfaces with the same boundary. We specialize this result to a constant mean curvature, obtaining a characterization of totally umbilic hypersurface caps.     

On Shape Preserving C2 Hermite Interpolation

We propose a general parametric local approach for functional C ² Hermite shape preserving interpolation. The constructed interpolant is a parametric curve which interpolate values, first and second derivatives of a given function and reproduces the behavior of the data. The method is detailed for parametric curves with piecewise cubic components. For the selected space necessary and sufficient conditions are derived to ensure the convexity of the constructed interpolant. Monotonicity is also studied. The approximation order is investigated for both cases. The use of a parametric curves to interpolate data from a function can be considered a disadvantage of the scheme. However, the simple structure of the used curve greatly reduces such a disadvantage.     

Linear multiplicative programming

An algorithm for solving a linear multiplicative programming problem (referred to as LMP) is proposed. LMP minimizes the product of two linear functions subject to general linear constraints. The product of two linear functions is a typical non-convex function, so that it can have multiple local minima. It is shown, however, that LMP can be solved efficiently by the combination of the parametric simplex method and any standard convex minimization procedure. The computational results indicate that the amount of computation is not much different from that of solving linear programs of the same size. In addition, the method proposed for LMP can be extended to a convex multiplicative programming problem (CMP), which minimizes the product of two convex functions under convex constraints.     

含参集值向量均衡问题各种有效解映射的下半连续性

在实Hausdorff拓扑向量空间中,引进含参集值向量均衡问题,给出各种有效解的概念.在锥-次类凸的条件下,得到各种有效解的标量化结果.结合集值映射的弱f-性,在适当假设条件下,得到含参集值向量均衡问题各种有效解映射的下半连续性.     

Robinson metric regularity of parametric variational systems

In this paper, the Robinson metric regularity of a parametric variational system is investigated. Some applications to the contingent derivative of parametric variational system and to the Robinson metric regularity of a parametric vector optimization problem are then studied.     

Efficient algorithms for solving rank two and rank three bilinear programming problems

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rⁿ¹ and Y R ⁿ² are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010.     

线性交叉规划的等价形式

本文利用参数规划的逆问题考虑交叉规划与多目标规划的关系,把交叉规划转变为部分同变量规划组,再把部分同变量规划组转化为一个多目标规划,并说明了交叉规划的均衡解与多目标规划的最优解的关系．     

Minimax linear programming problem

In this paper, we consider the following minimax linear programming problem: min z = max_{1 ≤ j ≤ n}{C_jX_j}, subject to Ax = g, x ≥ 0. It is well known that this problem can be transformed into a linear program by introducing n additional constraints. We note that these additional constraints can be considered implicitly by treating them as parametric upper bounds. Based on this approach we develop two algorithms: a parametric algorithm and a primal—dual algorithm. The parametric algorithm solves a linear programming problem with parametric upper bounds and the primal—dual algorithm solves a sequence of related dual feasible linear programming problems. Computation results are also presented, which indicate that both the algorithms are substantially faster than the simplex algorithm applied to the enlarged linear programming problem.     

参数弱向量平衡问题解集映射的连续性

运用非线性标量化方法, 讨论参数弱向量平衡问题解集映射的上半连续性和下半连续性, 并举例说明了所得结果的正确性.     

含参广义集值强向量平衡问题的稳定性

本文借助集合极限的性质和弱f-性假设证明了含参广义集值强向量平衡问题解集映射的下半连续性,其方法不同于最近文献(Zhao,2016和Meng,2018).此外,建立了含参广义集值强向量平衡问题解集连通性的充分条件,并举例验证了所得结果的正确性.本文得结果推广和改进了已有文献(Gong,2008,Xu,2009,Chen,2010,Xu,2013和Zhao,2013)中相应结果.     

基于存货质押融资业务的阶段贷款最优决策研究

存货质押融资业务作为解决中小企业融资的方式之一在国内外都有所发展,这种业务模式在解决银行和企业委托代理问题的同时,引入了新的银行与物流企业之间的委托代理问题。本文针对新的问题,引入阶段贷款的方法来控制风险和降低道德风险,运用参数函数比较了阶段贷款和一次性贷款的异同,得出了阶段贷款优于一次性贷款的结论,并通过运用合约作为阶段贷款的有效补充机制来更好的控制代理问题。