邻域整点搜索法求解整数规划

从剖析线性规划的优化机理入手,将纯整数规划分为标准型和非标型两类.首先以标准型纯整数规划为突破口,提出一种新的解法,并在理论上加以证明,然后将其拓广延伸,用于求解非标准型纯整数规划和混合整数规划.这种新解法命名为松驰最优解邻域整点搜索法,属于常规解法,但在简捷高效方面,远胜过现有的两种常规解法—分枝定界法和割平面法.     

一类非线性整数规则及其应用

设某县有中学n所，记为S_1,S_2…，S_i…,S_n.S_i校在校生M~（i）人，教师X_i人，     

线性规划标准型和整数线性规划最优解的两个注记

本文研究线性规划标准型的基本假设所蕴含的一些性质,并探讨整数线性规划最优解和其松弛问题最优解的关系.首先,分别讨论四种情形下线性规划最优解的性质,即无约束线性规划问题、仅有非负约束的线性规划问题、仅有等式约束的线性规划问题,以及标准线性规划问题系数矩阵的列向量有为零的情形等.然后,构造两族二维整数线性规划,其松弛问题的最优解与其(整数)最优解"相距甚远".     

线性规划最优整数解问题例析

线性规划最优整数解不仅要考查同学们的作图能力,更考查了我们的分析图形的能力,下面我们就解决最优整数解的两个常用方法介绍给大家．     

改进的非线性整数规划算法

通过对LUUS随机搜索算法的分析，本文首次提出了一种改进的随机定向搜索法（MRDISA）通过实例计算，说明该算法的优点是最优解的可靠性不受初始值X^(0)和初始搜索范围R^(0)的影响，并可用于求解高维约束非线性整数规划问题。     

凸整数规划最优点的判定条件

本文得到判别已知可行整值点为凸整数规划最优解的一个充分条件,此条件只涉及目标函数在该整值点为中心的边长为2的超立方体上的性态.     

二阶随机占优约束下考虑偏度的投资组合模型

在DentchevaRuszczynski(2006)模型的基础上,考虑偏度对构建投资组合的影响,建立了二阶随机占优约束下最大化组合收益率偏度的投资组合优化模型,并应用分段线性近似方法将模型转化为一个非线性混合整数规划问题.利用中国股票市场的历史数据对所建模型进行了实证分析,结果表明,所建新模型比均值-方差-偏度模型和市场指数具有更稳健的表现.     

限制投资下界的风险证券有效组合模型及算法研究

本文研究了具有投资下界限制的风险证券有限组合决策问题，提出了限制投资下界的风险证券有效组合优化模型，在一定的条件下，给出了风险证券有限组合投资比例的算法及解析表示，最后进行了实际数值计算，结果说明了所给算法是有效和实用的。     

可再生能源系统的不确定性优化模型及求解

结合新提出的满意度方法和混合整数规划方法,给出了多态不确定性环境下可再生能源规划模型.该模型综合描述了多地区、多时期、多品种、多部门之间的可再生能源管理系统的复杂性、系统性、动态性和不确定性.最后的实例求解结果说明该模型能很好地反映能源安全性、系统可靠性与系统成本之间的关系,并能给出不同系统违反水平下的能源配置方式及增容计划,为决策者提供决策参考.     

Multiple criteria linear programming model for portfolio selection

The portfolio selection problem is usually considered as a bicriteria optimization problem where a reasonable trade-off between expected rate of return and risk is sought. In the classical Markowitz model the risk is measured with variance, thus generating a quadratic programming model. The Markowitz model is frequently criticized as not consistent with axiomatic models of preferences for choice under risk. Models consistent with the preference axioms are based on the relation of stochastic dominance or on expected utility theory. The former is quite easy to implement for pairwise comparisons of given portfolios whereas it does not offer any computational tool to analyze the portfolio selection problem. The latter, when used for the portfolio selection problem, is restrictive in modeling preferences of investors. In this paper, a multiple criteria linear programming model of the portfolio selection problem is developed. The model is based on the preference axioms for choice under risk. Nevertheless, it allows one to employ the standard multiple criteria procedures to analyze the portfolio selection problem. It is shown that the classical mean-risk approaches resulting in linear programming models correspond to specific solution techniques applied to our multiple criteria model. This revised version was published online in June 2006 with corrections to the Cover Date.     

非线性整数规划的一个近似算法

利用连续总体优化填充函数法的思想，本文设计了非线性整数规划的一个近似算法．首先，给出了非线性整数规划问题离散局部极小解的定义，设计了找离散局部极小解的局部搜索算法；其次，用所设计的局部搜索算法极小化填充函数来找比当前离散局部极小解好的解．本文的近似算法是直接法，且与连续总体优化的填充函数法相比，本文填充函数中的参数易于选取．数值试验表明，本文的近似算法是有效的．     

Stochastic linear knapsack programming problem and its application to a portfolio selection problem

In this paper a probability maximization model of a stochastic linear knapsack problem is considered where the random variables consist of several groups with mutually correlated ones. We propose a solution algorithm to the equivalent nonlinear fractional programming problem with a simple ranking method. This approach will be effectively applied to one of the portfolio selection problems.     

A branch-and-bound algorithm for 0–1 parametric mixed integer programming

A branch-and-bound algorithm to solve 0–1 parametric mixed integer linear programming problems has been developed. The present algorithm is an extension of the branch-and-bound algorithm for parametric analysis on pure integer programming. The characteristic of the present method is that optimal solutions for all values of the parameter can be obtained.     

Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming

Many problems faced by decision makers are characterized by a multistage decision process with uncertainty about the future and some decisions constrained to take on values of either zero or one (for example, either open a facility at a location or do not open it). Although some mathematical theory exists concerning such problems, no general-purpose algorithms have been available to address them. In this article, we introduce the first implementation of general purpose methods for finding good solutions to multistage, stochastic mixed-integer (0, 1) programming problems. The solution method makes use of Rockafellar and Wets' progressive hedging algorithm that averages solutions rather than data. Solutions to the induced quadratic (0,1) mixed-integer subproblems are obtained using a tabu search algorithm. We introduce the notion of integer convergence for progressive hedging. Computational experiments verify that the method is effective. The software that we have developed reads standard (SMPS) data files.     

Integrating local search techniques into mixed integer programming

We survey the main results of the authors PhD thesis that was supervised by Claude Le Pape (ILOG, France) and Philippe Michelon (Université dAvignon, France) and has been defended in June 2004. The dissertation is written in French and is available from the author. It introduces several strategies for integrating local search techniques into mixed integer programming, with an emphasis on generic algorithms.Received: June 2004, MSC classification: 90C11, 90C59     

Ranking in integer linear fractional programming problems

An algorithm is developed which ranks the feasible solutions of an integer fractional programming problem in decreasing order of the objective function values.

---

Zusammenfassung Es wird ein Algorithmus angegeben, der die zulässigen Lösungen eines ganzzahligen Quotientenprogrammes nach fallenden Zielfunktionswerten liefert.

     

A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem

In this paper, we consider an extension of the Markovitz model, in which the variance has been replaced with the Value-at-Risk. So a new portfolio optimization problem is formulated. We showed that the model leads to an NP-hard problem, but if the number of past observation T or the number of assets K are low, e.g. fixed to a constant, polynomial time algorithms exist. Furthermore, we showed that the problem can be formulated as an integer programming instance. When K and T are large and α^VaR is small—as common in financial practice—the computational results show that the problem can be solved in a reasonable amount of time.     

Marginal values in mixed integer linear programming

For a given optimization problem, P, considered as a function of the data, its marginal values are defined as the directional partial derivatives of the value of P with respect to perturbations in that data. For linear programs, formulas for the marginal values were given by Mills, [10], and further developed by the current author [16]. In this paper, the marginal value formulas are extended to the case of mixed integer linear programming (MIP). As in ordinary linear programming, discontinuities in the value can occur, and the analysis here identifies them. This latter aspect extends previous work on continuity by the current author, [18], Geoffrion and Nauss, [5], Nauss, [11], and Radke, [12], and work on the value function of Blair and Jeroslow, [2]. Application is made to model formulation and to post-optimal analysis.Supported in part by the Air Force Office of Scientific Research, Grant # AFSOR-0271 to Rutgers University.     

国际原油价格预测的双层随机整数规划模型、算法及应用

根据国际原油价格近期数据及原油价格变化量,给出了国际原油价格改变量的状态转移概率(或频率)矩阵.依此提出以国际原油价格预测误差的期望与方差最小为最优目标,建立国际原油价格预测的双层随机整数规划,并论述该优化问题最优解的存在性, 根据约束特性构造了优化算法.同时按照国内现行成品油定价机制, 提出的优化算法,对国内成品油调价进行了预测,实证分析表明提出的模型与优化算法具有一定的预测精度和较好的实用性.