解带有等式约束的可能性线性规划问题

本文给出了等式约束与不等式约束的关系定理,解决了带等式约束的可能性线性规划问题。     

On Weighted Possibilistic Mean,Variance and Correlation of Interval-valued Fuzzy Numbers

In this paper, the concept of weighted possibilistic mean of interval- valued fuzzy number is first introduced. Further, the notions of weighted possibilistic variance, covariance and correlation of interval-valued fuzzy numbers are presented. Meantime, some important properties of them and relationships between them are studied.     

Possibilistic linear regression analysis for fuzzy data

Fuzzy data given by expert knowledge can be regarded as a possibility distribution by which possibilistic linear systems are defined. Recently, it has become important to deal with fuzzy data in connection with expert knowledge. Three formulations of possibilistic linear regression analysis are proposed here to deal with fuzzy data. Since our formulations can be reduced to linear programming problems, the merit of our formulations is to be able to obtain easily fuzzy parameters in possibilistic linear models and to add other constraint conditions which might be obtained from expert knowledge of fuzzy parameters. This approach can be regarded as a fuzzy interval analysis in a fuzzy environment.     

Duality Theory in Fuzzy Optimization Problems

A solution concept of fuzzy optimization problems, which is essentially similar to the notion of Pareto optimal solution (nondominated solution) in multiobjective programming problems, is introduced by imposing a partial ordering on the set of all fuzzy numbers. We also introduce a concept of fuzzy scalar (inner) product based on the positive and negative parts of fuzzy numbers. Then the fuzzy-valued Lagrangian function and the fuzzy-valued Lagrangian dual function for the fuzzy optimization problem are proposed via the concept of fuzzy scalar product. Under these settings, the weak and strong duality theorems for fuzzy optimization problems can be elicited. We show that there is no duality gap between the primal and dual fuzzy optimization problems under suitable assumptions for fuzzy-valued functions.     

Bound Constrained Smooth Optimization for Solving Variational Inequalities and Related Problems

Variational inequalities and related problems may be solved via smooth bound constrained optimization. A comprehensive discussion of the important features involved with this strategy is presented. Complementarity problems and mathematical programming problems with equilibrium constraints are included in this report. Numerical experiments are commented. Conclusions and directions of future research are indicated.     

Possibilistic Linear Programming with Fuzzy If-Then Rule Coefficients

In this paper, we propose a scenario decomposition approach for the treatment of interactive fuzzy numbers. Scenario decomposed fuzzy numbers (SDFNs) reflect a fact that we may have different estimations of possible ranges of uncertain variables depending on scenarios, which are expressed by fuzzy if-then rules. The properties of SDFNs are investigated. Possibilistic linear programming problems with SDFNs are formulated by two different approaches, fractile and modality optimization approaches. It is shown that the problems are reduced to linear programming problems in fractile optimization models with the necessity measures and that the problems can be solved by a linear programming technique and a bisection method in modality optimization models with necessity measures. A simple numerical example is given.     

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

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

最优化问题的并行算法

本文对求解非线性最优化问题的几种主要并行思想，即按变量分裂的并行算法，函数值、梯度值的并行计算，计算步骤并行的算法等，作了简要的综述，并介绍了近几年在这方面取得的进展．     

基于加权可能性均值的亚式期权模糊定价

主要探讨不确定环境下用模糊集理论处理亚式期权的定价问题.运用梯形模糊数来表示标的资产价格、无风险利率、红利率和波动率,建立了亚式期权的加权可能性均值模糊定价模型,得到连续几何和算术亚式期权的模糊价格公式.最后通过数值例子表明:亚式期权的加权可能性均值模糊定价模型具有很大的灵活性,更符合现实的不确定情况,具有较强的实用价值.     

车辆路径问题的混合优化算法

讨论了一类车辆路径调度问题(VRP)及其数学模型，并且分析了以遗传算法求解该类问题时的染色体表示和有关遗传操作，然后结合2-opt局部优化算法提出了GA with2-opt算法来求解VRP问题，试验结果说明了该算法的有效性和可行性。     

幂模糊数方程和二次模糊方程的结构元求解方法

定义了幂模糊数和幂模糊数方程,基于结构元方法研究了幂模糊数运算和幂模糊数方程的求解,给出了隶属函数的表达式.同时,利用区间[-1,1]上的单调函数将二次模糊方程的求解问题转化为经典参数方程组的求解问题,给出了二次模糊方程解存在的充要条件,并辅以数值例子.     

Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization

This contribution gives an overview on the state-of-the-art and recent advances in mixed integer optimization to solve planning and design problems in the process industry. In some case studies specific aspects are stressed and the typical difficulties of real world problems are addressed. Mixed integer linear optimization is widely used to solve supply chain planning problems. Some of the complicating features such as origin tracing and shelf life constraints are discussed in more detail. If properly done the planning models can also be used to do product and customer portfolio analysis. We also stress the importance of multi-criteria optimization and correct modeling for optimization under uncertainty. Stochastic programming for continuous LP problems is now part of most optimization packages, and there is encouraging progress in the field of stochastic MILP and robust MILP. Process and network design problems often lead to nonconvex mixed integer nonlinear programming models. If the time to compute the solution is not bounded, there are already a commercial solvers available which can compute the global optima of such problems within hours. If time is more restricted, then tailored solution techniques are required.     

A Finite Algorithm for Solving Infinite Dimensional Optimization Problems

We consider the general optimization problem (P) of selecting a continuous function x over a -compact Hausdorff space T to a metric space A, from a feasible region X of such functions, so as to minimize a functional c on X. We require that X consist of a closed equicontinuous family of functions lying in the product (over T) of compact subsets Y _t of A. (An important special case is the optimal control problem of finding a continuous time control function x that minimizes its associated discounted cost c(x) over the infinite horizon.) Relative to the uniform-on-compacta topology on the function space C(T,A) of continuous functions from T to A, the feasible region X is compact. Thus optimal solutions x ^* to (P) exist under the assumption that c is continuous. We wish to approximate such an x ^* by optimal solutions to a net {P _i }, iI, of approximating problems of the form min_{xX i} c i(x) for each iI, where (1) the net of sets {X _i } _I converges to X in the sense of Kuratowski and (2) the net {c _i } _I of functions converges to c uniformly on X. We show that for large i, any optimal solution x ^* _i to the approximating problem (P _i ) arbitrarily well approximates some optimal solution x ^* to (P). It follows that if (P) is well-posed, i.e., limsupX _i ^* is a singleton {x ^*}, then any net {x _i ^*} _I of (P _i )-optimal solutions converges in C(T,A) to x ^*. For this case, we construct a finite algorithm with the following property: given any prespecified error and any compact subset Q of T, our algorithm computes an i in I and an associated x _i ^* in X _i ^* which is within of x ^* on Q. We illustrate the theory and algorithm with a problem in continuous time production control over an infinite horizon.     

A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

Monotone optimization problems are an important class of global optimization problems with various applications. In this paper, we propose a new exact method for monotone optimization problems. The method is of branch-and-bound framework that combines three basic strategies: partition, convexification and local search. The partition scheme is used to construct a union of subboxes that covers the boundary of the feasible region. The convexification outer approximation is then applied to each subbox to obtain an upper bound of the objective function on the subbox. The performance of the method can be further improved by incorporating the method with local search procedure. Illustrative examples describe how the method works. Computational results for small randomly generated problems are reported. Dedicated to Professor Alex Rubinov on the occasion of his 65th birthday. The authors appreciate very much the discussions with Professor Alex Rubinov and his suggestion of using local search. Research supported by the National Natural Science Foundation of China under Grants 10571116 and 10261001, and Guangxi University Scientific Research Foundation (No. X051022).     

Possibilistic bottleneck combinatorial optimization problems with ill-known weights

In this paper a general bottleneck combinatorial optimization problem with uncertain element weights modeled by fuzzy intervals is considered. A possibilistic formalization of the problem and solution concepts in this setting, which lead to compute robust solutions under fuzzy weights, are given. Some algorithms for finding a solution according to the introduced concepts and evaluating optimality of solutions and elements are provided. These algorithms are polynomial for bottleneck combinatorial optimization problems with uncertain element weights, if their deterministic counterparts are polynomially solvable.     

Neural Approach for Solving Several Types of Optimization Problems

Neural networks consist of highly interconnected and parallel nonlinear processing elements that are shown to be extremely effective in computation. This paper presents an architecture of recurrent neural net-works that can be used to solve several classes of optimization problems. More specifically, a modified Hopfield network is developed and its inter-nal parameters are computed explicitly using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points, which represent a solution of the problem considered. The problems that can be treated by the proposed approach include combinatorial optimiza-tion problems, dynamic programming problems, and nonlinear optimization problems.Communicated by L. C. W. Dixon     

Parallel Characteristical Algorithms for Solving Problems of Global Optimization

A class of parallel characteristical algorithms for global optimization ofone-dimensional multiextremal functions is introduced. General convergence andefficiency conditions for the algorithms of the class introduced areestablished. A generalization for the multidimensional case is considered.Examples of parallel characteristical algorithms and numerical experiments arepresented.     

多目标优化问题的模糊交叉算法与收敛性

本文研究了目标权重未事先确知的多目标优化问题，建立可以同时确定目标权重与方案相对优属度的模糊交叉迭代算法，严格证明了该算法的局部收敛性．     

基于粒子群算法的非线性二层规划问题的求解算法

粒子群算法（Particle Swarm Optimization，PSO）是一种新兴的优化技术，其思想来源于人工生命和演化计算理论。PSO通过粒子追随自己找到的最好解和整个群的最好解来完成优化。该算法简单易实现，可调参数少，已得到了广泛研究和应用。本文根据该算法能够有效的求出非凸数学规划全局最优解的特点，对非线性二层规划的上下层问题求解，并根据二层规划的特点，给出了求解非线性二层规划问题全局最优解的有效算法。数值计算结果表明该算法有效。     

以模糊数排序为基础的可能性线性规划分析——兼与文献[1]作者商榷

对文献 [1]提出的可能性线性规划的非模糊等价模型从模糊数排序分析的角度阐述并举证了该模型的非有效性。因而 ,以此为基础对原规划作出的变换被视为不良变换。为克服这一缺陷 ,提出相应的改正模型 ,并结合例题进行比较分析。