具有模糊系数的模糊线性规划问题

本文考虑具有模糊系数的模糊线性规划问题中各系数的模糊可能性分布，而用指数（或线性）的隶属函数来描述，然后使用模糊数集上的实值函数，使模糊数在模型均值的意义下对应于一个实数，借此，将原问题公式化为一个普通线性规划。     

Subdifferentiability and the Duality Gap

We point out a connection between sensitivity analysis and the fundamental theorem of linear programming by characterizing when a linear programming problem has no duality gap. The main result is that the value function is subdifferentiable at the primal constraint if and only if there exists an optimal dual solution and there is no duality gap. To illustrate the subtlety of the condition, we extend Kretschmer's gap example to construct (as the value function of a linear programming problem) a convex function which is subdifferentiable at a point but is not continuous there. We also apply the theorem to the continuum version of the assignment model.     

A Class of Quadratic Integral-Differential Equations

A nonlinear integro-ordinary differential equation built up by a linear ordinary differential operator of n th order with constant coefficients and a quadratic integral term is dealt with. The integral term represents the so-called autocorrelation of the unknown function. Applying the Fourier cosine transformation, the integral-differential equation is reduced to a quadratic boundary value problem for the complex Fourier transform of the solution in the upper half-plane. This problem in turn is reduced to a linear boundary value problem which can be solved in closed form. There are infinitely many solutions of the integral-differential equation depending on the prescribed zeros of a function related to the complex Fourier transform.     

A note on degeneracy in linear programming

We show that the problem of exiting a degenerate vertex is as hard as the general linear programming problem. More precisely, every linear programming problem can easily be reduced to one where the second best vertex (which is highly degenerate) is already given. So, to solve the latter, it is sufficient to exit that vertex in a direction that improves the objective function value.     

Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach

For the linear bilevel programming problem, we propose an assumption weaker than existing assumptions, while achieving similar results via a penalty function approach. The results include: equivalence between (i) existence of a solution to the problem, (ii) existence of an exact penalty function approach for solving the problem, and (iii) achievement of the optimal value of the equivalent form of the problem at some vertex of a certain polyhedral convex set. We prove that the assumption is both necessary and sufficient for the linear bilevel programming problem to admit an exact penalty function formulation, provided that the equivalent form of the problem has a feasible solution. A method is given for computing the minimal penalty function parameter value. This method can be executed by solving a set of linear programming problems. Lagrangian duality is also presented.     

Greenʼs function for first-order multipoint boundary value problems and applications to the existence of solutions with constant sign

We consider a first-order linear differential equation subject to boundary value conditions which take into account the values of the function at multiple points in the interval of interest. For this problem, we calculate the Green?s function which allows to express in integral form the exact expression of the unique solution to the multipoint boundary value problem under the appropriate conditions. From this study, some results are derived concerning the existence of solutions with a constant sign (that is, some comparison results for first-order multipoint boundary value problems).     

On an elliptic equation of Kirchhoff-type with a potential asymptotically linear at infinity

This paper examines the existence of positive solutions for a boundary value problem of Kirchhoff-type involving a positive potential function which is asymptotically linear at infinity.     

Universal boundary value problem for equations of mathematical physics

A new statement of a boundary value problem for partial differential equations is discussed. An arbitrary solution to a linear elliptic, hyperbolic, or parabolic second-order differential equation is considered in a given domain of Euclidean space without any constraints imposed on the boundary values of the solution or its derivatives. The following question is studied: What conditions should hold for the boundary values of a function and its normal derivative if this function is a solution to the linear differential equation under consideration? A linear integral equation is defined for the boundary values of a solution and its normal derivative; this equation is called a universal boundary value equation. A universal boundary value problem is a linear differential equation together with a universal boundary value equation. In this paper, the universal boundary value problem is studied for equations of mathematical physics such as the Laplace equation, wave equation, and heat equation. Applications of the analysis of the universal boundary value problem to problems of cosmology and quantum mechanics are pointed out.     

Polyhedral functions and multiparametric linear programming

In a linear programming problem with a vector parameter appearing on the right-hand side, the minimum value of the objective is a polyhedral function of this parameter. We show how different characterizations of a polyhedral function correspond to different ways of solving the right-hand side multiparameteric linear programming problem.     

Generalized Newton method for linear optimization problems with inequality constraints

A dual problem of linear programming is reduced to the unconstrained maximization of a concave piecewise quadratic function for sufficiently large values of a certain parameter. An estimate is given for the threshold value of the parameter starting from which the projection of a given point to the set of solutions of the dual linear programming problem in dual and auxiliary variables is easily found by means of a single solution of the unconstrained maximization problem. The unconstrained maximization is carried out by the generalized Newton method, which is globally convergent in an a finite number of steps. The results of numerical experiments are presented for randomly generated large-scale linear programming problems.     

Subgradients of the Value Function to a Parametric Optimal Control Problem

This paper studies the first-order behavior of the value function of a parametric optimal control problem with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of the value functions of a parametric mathematical programming problem, a new formula for computing the Fréchet subdifferential of the value function to a parametric optimal control problem is obtained.     

Uniformly Lipschitz feedback optimal controls in a linear-quadratic framework

A uniformly k-Lipschitz feedback optimal control problem is considered in a linear quadratic framework. The value function is derived by a comparison-based reasoning, via which a necessary condition to the existence of optimal solutions is obtained: optimal feedback controls must be linear.     

A General Darboux-Type Boundary Value Problem in Curvilinear Domains with Corners for a Third-Order Equation with Dominated Lower-Order Terms

We study solvability of the Darboux-type boundary value problem for a third-order linear partial differential equation with dominated lower-order terms. We indicate function spaces in which the problem is uniquely solvable and Hausdorff normally solvable. In the second case, the corresponding homogeneous problem is shown to have infinitely many linearly independent solutions.     

带有模糊约束的房地产投资随机期望值模型

基于可信性理论,提出一类新的带有模糊约束的房地产投资随机期望值模型来处理房地产经济中的不确定性信息.另一方面,通过目标函数和可信性函数的一些性质将提出的房地产投资问题转化为一个等价的线性形式,从而可以利用经典的线性规划算法进行求解.最后,给出一个房地产投资问题的实例并通过Lindo软件进行求解.     

A superharmonic approach to solving infinite horizon partially observable Markov decision problems

In this paper we use an approach which uses a superharmonic property of a sequence of functions generated by an algorithm to show that these functions converge in a non-increasing manner to the optimal value function for our problem, and bounds are given for the loss of optimality if the computational process is terminated at any iteration. The basic procedure is to add an additional linear term at each iteration, selected by solving a particular optimisation problem, for which primal and dual linear programming formulations are given.     

P*(κ)阵线性互补问题一种新的宽邻域预估-校正内点算法

基于邻近度量函数的最小值,对P*(κ)阵线性互补问题提出了一种新的宽邻域预估-校正算法,在较一般的条件下,证明了算法的迭代复杂性为O(κ+1)23n log(x0ε)Ts0.算法既可视为Miao的P*(κ)阵线性互补问题Mizuno-Todd-Ye预估-校正内点算法的一种变形,也可以视为最近Zhao提出的线性规划基于邻近度量函数最小值的宽邻域内点算法的推广.     

������Լ������������ɢ����ģ���е����ŷֺ����

For a financial or insurance entity, the problem of finding the optimal dividend distribution strategy and optimal firm value function is a widely discussed topic. In the present paper, it is assumed that the firm faces two types of liquidity risks: a Brownian risk and a Poisson risk. The firm can control the time and amount of dividends paid out to shareholders. By sufficiently taking into account the safety of the company, bankruptcy is said to take place at time $t$ if the cash reserve of the firm runs below the linear barrier b+kt (not zero), see 1. We deal with the problem of maximizing the expected total discounted dividends paid out until bankruptcy. The optimal dividend return (or, firm value) function is identified as the classical solution of the associated Hamilton-Jacobi-Bellman (HJB) equation where a second-order differential-integro equation is involved. By solving the corresponding HJB equation, the analytical solution of the optimal firm value function is obtained, the optimal dividend strategy is also characterized, which is of linear barrier type: at time t the firm keeps cash inside when the cash reserves level is less than a critical linear barrier and pays cash in excess of this linear barrier as dividends.     

Optimal design of a manpower system

An equilibrium model of a manpower system is developed based on the notion of a career flow. Institutional constraints and measures of system performance are linear functions of the career flow. A typical optimal design problem is formulated and a solution procedure is developed. The optimization problem is a generalized linear program in which columns are generated by solving a shortest path problem. Upper and lower bounds on the optimal value function can be developed at each stage of the calculations.This research was supported by ONR grant N00014-75-C-0619.     

Graph algorithm for partially-linear problems obtained by absolute value functions

The increasing interest in partially-linear models is caused by their role in economics, technology and mathematics. Every continuous partially-linear function with a finite number of linear parts can be formulated by means of linear function and absolute value functions. If we presebt every absolote value function as vertex of a graph we obtain the graph interpretaion of this optimization problem. The Partially-linear problems are often not only nondifferentiable but nonconvex as well,which makes their solving by standard optimization methods difficult. In this work we give the necessary and sufficient conditions for local optimality. An algorithm for solving such problems, based on the constructive optimization methods is suggested.     

Application of self-adjoint boundary value problems to investigation of stability of periodic delay systems

The problem on determining conditions for the asymptotic stability of linear periodic delay systems is considered. Solving this problem, we use the function space of states. Conditions for the asymptotic stability are determined in terms of the spectrum of the monodromy operator. To find the spectrum, we construct a special boundary value problem for ordinary differential equations. The motion of eigenvalues of this problem is studied as the parameter changes. Conditions of the stability of the linear periodic delay system change when an eigenvalue of the boundary value problem intersects the circumference of the unit disk. We assume that, at this moment, the boundary value problem is self-adjoint. Sufficient coefficient conditions for the asymptotic stability of linear periodic delay systems are given.