目标规划法在证券组合投资中的应用

证券投资是目前我国经济中的一大热点。本以Markowitz证券组合投资理论为基础，运用目标规划的方法建立一种新的证券组合投资决策模型。在本模型中综合考虑了证券组合的收益，风险，交易费用等因素，对投资选择有效证券组合有一定的实用价值。     

含交易费用的投资组合问题的新模型及其求解途径

本文提出了证券投资组合的一个新模型.该模型综合考虑了证券的收益率、证券分红和证券价格的关系,并将证券分红和证券价格作为系统的随机参数处理,建立了证券投资组合的随机规划模型.利用机会约束规划方法,我们研究了将所建立的随机规划模型转化为普通光滑优化问题求解的方法,得到了该类问题求解的有效途径.     

限制卖空证券组合有效边缘的灵敏度分析

本文利用参数二次规划对偶性理论讨论了限制卖空的证券组合有效边缘的性质。分析的结果表明：有限制卖空的证券组合的有效边缘是一条连续的、凸的、分片二次函数连接而成的曲线。应用三元分割技术可以得到,在可选择证券空间上,有些证券从不会作为投资选择的对象。     

投资组合模型的分式规划解法

以E-SV风险测度为基础提出了组合证券投资决策的效用函数,并建立了基于分式规划的投资组合选择模型,利用变换,把求解分式规划的问题转化为求解非分式规划问题。     

剩余劳动力配置的多目标规划模型研究

本利用证券组合投资的理论,建立了剩余劳动力配置的多目标优化模型,并给出其解法,旨在提高剩余劳动力转移的效率。     

一种基于区间数的证券组合投资模型与求解

提出了区间数的相对左偏度的定义.利用区间数的相对左偏度作为区间数下表达证券风险损失率的一种补充,能合理地反映风险损失率与预期收益率之间的相关关系.建立了一种新的证券组合投资区间数规划模型,将区间数规划模型转化为参数线性规划问题求解,使证券组合投资决策分析更加具有柔性.最后通过实例分析了该模型的应用价值.     

有效集法在确定Markowitz''''s证券组合投资模型权系数中的应用

在分析Markowitz's证券组合投资模型最优解方法的基础上,给出了求解Markowitz's证券组合投资模型的有效集法;用该方法对一个具体实例的允许卖空情形与不允许卖空情形分别进行计算求解,实例的数值计算结果显示该方法是可行有效的.     

证券组合投资的动态模型研究

本文利用方差和绝对离差这两个风险度量指标 ,分别建立了证券组合投资的动态模型 ,并给出其解法 .从而使模型更符合实际 ,有利于实施最佳的组合投资的策略 .     

研究国际证券投资及其有效集的多目标线性规划方法

本文给出国际证券组合投资决策的多目标线性规划模型，以及求解有效国际证券组合的偏好系数加权法．在此基础上，应用线性多数规划技术研究有效国际证券组合集的几何特征，并给出相应结论和简单算例．     

具指数赋权指标的证券投资多目标线性规划模型

本文提出证券投资决策的指数赋权指标体系．在该指标体系中,建立风险证券组合投资决策和存在无风险证券或无风险贷款时证券组合投资决策的多目标线性规划模型．研究了有效风险证券组合集和有效证券组合集的结构和相互关系,市场证券组合以及证券均衡市场价格和投资风险分析．     

Designing a majorization scheme for the recourse function in two-stage stochastic linear programming

We discuss issues pertaining to the domination from above of the second-stage recourse function of a stochastic linear program and we present a scheme to majorize this function using a simpler sublinear function. This majorization is constructed using special geometrical attributes of the recourse function. The result is a proper, simplicial function with a simple characterization which is well-suited for calculations of its expectation as required in the computation of stochastic programs. Experiments indicate that the majorizing function is well-behaved and stable.     

Mathematical programming techniques in majorization

In this paper, we are concerned with mathematical programs which construct nonmajorizing vectors for several specific majorization applications. In particular, we develop a linear integer program and two integer goal programs which solve the assignment majorization problem. We also develop a quadratic program for solving majorization problems which arise in probability and statistics. In the appendix, we present a general goal-programming algorithm for these, as well as others, goal programs.The authors would like to thank Professor Y. Tong for introducing them to majorization and its applications. They would also like to thank Professors Y. Tong and D. Mesner for helpful discussions.     

一类0-1二次规划最优解的新算法

从矩阵的基础知识出发,给出了当目标函数矩阵是严格对角占优阵时,快速地获得0-1二次规划最优解的一个新算法;该方法具有很强的实用性,是此类问题的一个高效求解算法.     

带有随机因素的逆DEA模型

本文讨论含有随机因素的逆 DEA模型 .逆 DEA模型解决的问题是 :对于某个决策单元 (DMU ) ,若增加其输入 ,在保持相对效率水平不变的情况下 ,估计 (预测 )输出应增加多少 .因此逆 DEA模型可用于短期预测问题 .带有随机因素的逆 DEA模型 ,是将该问题转化成机会约束的多目标规划问题 ,在某些特殊情况下 ,成为机会约束的线性规划问题 .     

Deriving an unconstrained convex program for linear programming

Consider a linear programming problem in Karmarkar's standard form. By perturbing its linear objective function with an entropic barrier function and applying generalized geometric programming theory to it, Fang recently proposed an unconstrained convex programming approach to finding an epsilon-optimal solution. In this paper, we show that Fang's derivation of an unconstrained convex dual program can be greatly simplified by using only one simple geometric inequality. In addition, a system of nonlinear equations, which leads to a pair of primal and dual epsilon-optimal solutions, is proposed for further investigation.This work was partially supported by the North Carolina Supercomputing Center and a 1990 Cray Research Grant. The authors are indebted to Professors E. L. Peterson and R. Saigal for stimulating discussions.     

A finite algorithm for the least two-norm solution of a linear program 1

By perturbing properly a linear program to a separable quadratic program it is possible to solve the latter in its dual variable space by iterative techniques such as sparsity-preserving SOR (successive overtaxation techniques). In this way large sparse linear programs can be handled.

In this paper we give a new computational criterion to check whether the solution of the perturbed quadratic program provides the least 2-norm solution of the original linear program. This criterion improves on the criterion proposed in an earlier paper.

We also describe an algorithm for solving linear programs which is based on the SOR methods. The main property of this algorithm is that, under mild assumptions, it finds the least 2-norm solution of a linear program in a finite number of iteration.s     

二(双)层规划综述

二(双)层规划是研究二层决策的递阶优化问题.其理论、方法和应用在过去的30多年取得了很大的发展.本文对二层规划问题的基本概念、性质和算法作了综述,并且对下层规划问题的解不唯一的情况也作了介绍,最后还给出了几种常见的二层规划模型.     

A stochastic programming approach to cash management in banking

The treasurer of a bank is responsible for the cash management of several banking activities. In this work, we focus on two of them: cash management in automatic teller machines (ATMs), and in the compensation of credit card transactions. In both cases a decision must be taken according to a future customers demand, which is uncertain. From historical data we can obtain a discrete probability distribution of this demand, which allows the application of stochastic programming techniques. We present stochastic programming models for each problem. Two short-term and one mid-term models are presented for ATMs. The short-term model with fixed costs results in an integer problem which is solved by a fast (i.e. linear running time) algorithm. The short-term model with fixed and staircase costs is solved through its MILP equivalent deterministic formulation. The mid-term model with fixed and staircase costs gives rise to a multi-stage stochastic problem, which is also solved by its MILP deterministic equivalent. The model for compensation of credit card transactions results in a closed form solution. The optimal solutions of those models are the best decisions to be taken by the bank, and provide the basis for a decision support system.     

Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs

In this paper, we consider a two-stage stochastic uncapacitated lot-sizing problem with deterministic demands and Wagner-Whitin costs. We develop an extended formulation in the higher dimensional space that provides integral solutions by showing that its constraint matrix is totally unimodular. We also provide the integral polyhedron of the problem in the original space by projecting the extended formulation to the original space.     

Bilevel Decision with Generalized Semi-infinite Optimization for Fuzzy Mappings as Lower Level Problems

In this paper, we introduce the bilevel decision problems with parametric generalized semi-infinite optimization for fuzzy mappings as the lower-level problem, and its corresponding MPEC problems. For these problems, we establish two models which are different in the feasible region setting of lower-level problems. Some new existence results are obtained in rather weak conditions.