Iterative variable aggregation and disaggregation in IP: An application

This paper, using the Unconstrained Shape Matrix Optimization Problem as a test bed, we investigate various aspects of variable aggregation and disaggregation for a class of integer programs that contains binary expansion. We present theoretical and numerical results, and propose an iterative algorithm for exact solutions.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

Bilevel programming approach applied to the flow shop scheduling problem under fuzziness

This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan. In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is given. Mathematics Subject Classification: 90C70, 90B36, 90C99     

多目标半定规划的互补弱鞍点和G-鞍点最优性条件

对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题，给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义．然后，在较弱的凸性条件下，利用含矩阵和向量约束的择一性定理，建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件．     

对于工学硕士的《数理统计》教学的研究

工学硕士的《数理统计》教学 ,要根据工学硕士的培养目标和数理统计课程的特点编写教材、确定讲授内容和授课方式 .力求使学员掌握处理随机数据的思考方法 ,培养解决问题、分析问题和善于应用知识的能力 .改革《数理统计》教学 ,实现和普及多媒体教学是时代发展的趋势 .     

求解非线性规划问题的光滑路径跟踪方法

通过对非线性规划问题的K-T点的光滑路径跟踪方法研究，得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法，证明了光滑跟踪路径的存在性。     

多目标规划的鞍点准则

本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法     

New Branch-and-Cut Algorithm for Bilevel Linear Programming

Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems. Work of the authors was partially supported by FCAR, MITACS and NSERC grants.     

Approximate Toeplitz Matrix Problem Using Semidefinite Programming

Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm.     

垃圾填埋场选址问题的模糊数学模型研究

为有助于在环境和经济框架内评价垃圾填埋场选址决策,本文建立了关于该问题的多目标模型,模型中既考虑了安置和运营设施需要的固定成本和可变成本,也考虑了居民区承受的风险,以及各居民区承担风险的公平性。并进一步讨论了用模糊方法处理的一般多目标规划模型的模糊最优解与有效解及弱有效解之间的关系。最后使用两种模糊目标规划方法求解数值例子以分析所建模型的适用性,结果表明,加权模糊方法可以为决策者提供更接近期望值的满意方案。