PARALLEL SOLUTION OF DISJUNCTIVE MINLP PROBLEMS

In this paper, a system for parallel solution of large scale disjunctive optimization problems is presented. Disjunctive optimization problems occur in process engineering; both in production scheduling and in process synthesis. In general these problems are computationally very hard to solve.

This system combines the demands of process engineering optimization problems with the potential CPU-power of the computers connected to the Internet. The system is capable of using an arbitrary number of computers connected to the Internet for distributed solution of rigorous industrial optimization problems.     

配电网络电容器实时优化投切的逐次线性整数规划法

并联补偿电容器组是配电网络无功优化的重要设备。本文从实时控制的角度研究电容器优化投切的台数问题，推导了其逐次线性整数规划模型，并提出了适合配电网电容器投切特点的对偶松弛解法和逐次归整解法。所得模型简洁，求解过程无振荡现象，收敛快，计算量小，且所得优化整数解不易偏离最优整数解。     

Computer‐aided design of ionic liquids as solvents for extractive desulfurization

Although ionic liquids (ILs) have been widely explored as solvents for extractive desulfurization (EDS) of fuel oils, systematic studying of the optimal design of ILs for this process is still scarce. The UNIFAC‐IL model is extended first to describe the EDS system based on exhaustive experimental data. Then, based on the obtained UNIFAC‐IL model and group contribution models for predicting the melting point and viscosity of ILs, a mixed‐integer nonlinear programming (MINLP) problem is formulated for the purpose of computer‐aided ionic liquid design (CAILD). The MINLP problem is solved to optimize the liquid‐liquid extraction performance of ILs in a given multicomponent model EDS system, under consideration of constraints regarding the IL structure, thermodynamic and physical properties. The top five IL candidates preidentified from CAILD are further evaluated by means of process simulation using ASPEN Plus. Thereby, [C₅MPy][C(CN)₃] is identified as the most suitable solvent for EDS. © 2017 American Institute of Chemical Engineers AIChE J, 64: 1013–1025, 2018     

A decomposition algorithm for simultaneous scheduling and control of CSP systems

We present a decomposition algorithm to perform simultaneous scheduling and control decisions in concentrated solar power (CSP) systems. Our algorithm is motivated by the need to determine optimal market participation strategies at multiple timescales. The decomposition scheme uses physical insights to create surrogate linear models that are embedded within a mixed‐integer linear scheduling layer to perform discrete (operational mode) decisions. The schedules are then validated for physical feasibility in a dynamic optimization layer that uses a continuous full‐resolution CSP model. The dynamic optimization layer updates the physical variables of the surrogate models to refine schedules. We demonstrate that performing this procedure recursively provides high‐quality solutions of the simultaneous scheduling and control problem. We exploit these capabilities to analyze different market participation strategies and to explore the influence of key design variables on revenue. Our results also indicate that using scheduling algorithms that neglect detailed dynamics significantly decreases market revenues. © 2018 American Institute of Chemical Engineers AIChE J, 64: 2408–2417, 2018     

Negative Binomial Quasi‐Likelihood Inference for General Integer‐Valued Time Series Models

Two negative binomial quasi‐maximum likelihood estimates (NB‐QMLEs) for a general class of count time series models are proposed. The first one is the profile NB‐QMLE calculated while arbitrarily fixing the dispersion parameter of the negative binomial likelihood. The second one, termed two‐stage NB‐QMLE, consists of four stages estimating both conditional mean and dispersion parameters. It is shown that the two estimates are consistent and asymptotically Gaussian under mild conditions. Moreover, the two‐stage NB‐QMLE enjoys a certain asymptotic efficiency property provided that a negative binomial link function relating the conditional mean and conditional variance is specified. The proposed NB‐QMLEs are compared with the Poisson QMLE asymptotically and in finite samples for various well‐known particular classes of count time series models such as the Poisson and negative binomial integer‐valued GARCH model and the INAR(1) model. Application to a real dataset is given.     

空分短期停车时间阈值对氧气生产调度的影响

针对钢铁企业高炉休风场景下的氧气生产调度问题,提出以空分短期计划性停车为主要手段的调度策略,并基于MILP方法建立了氧气系统的优化调度模型。调度模型的优化目标为整个规划周期内氧气高压管网的综合压力最小化。模型包含了空分和部分氧气压缩机短期停车再启动操作的约束条件,并结合实际情况考虑了前述设备的停车时间阈值和运行时间阈值。以国内某大型钢铁企业为实际案例,验证了调度模型的合理性与可行性,然后基于模型计算分析了空分停车时间阈值对调度目标的影响规律。分析结果表明,减小空分停车时间阈值有利于获得更优的调度目标,但空分停车时间阈值对优化目标的影响规律具有阶跃特性,而非简单的比例关系。     

一种基于固定正确率的GNSS模糊度差值检验阈值确定方法

整周模糊度固定是否正确对于GNSS高精度导航定位有着至关重要的影响.针对常规的差值检验阈值确定方法中存在的问题,从整数孔径估计理论出发,提出一种基于固定正确率的阈值确定方法.该方法既能根据模糊度维数选择更为合理的差值检验阈值,又能保证可靠的正确率水平,具有一定的理论意义和实用价值.     

An efficient reformulation of the multiechelon stochastic inventory system with uncertain demands

It is shown that by reformulating the three‐stage multiechelon inventory system with specific exact linearizations, larger problems can be solved directly with mixed‐integer linear programming (MILP) without decomposition. The new formulation is significantly smaller in the number of continuous variables and constraints. An MILP underestimation of the problem can be solved as part of a sequential piecewise approximation scheme to solve the problem within a desired optimality gap.     

基于Bresenham算法的整数反走样椭圆生成算法

针对目前尚不存在实用的整数反走样椭圆生成算法问题,利用修改的Bresenham算法,提出了一个完全利用整数运算实现的像素级反走样椭圆逐点绘制算法.该算法根据Bresenham算法中的误差控制参数产生候选点与理想直线间的精确距离,舍弃作用微小的高阶小量,利用整数比较法或查表法计算最近的两个像素的亮度.新算法将Bresenham椭圆生成与反走样统一在一个框架下,反走样绘制仅在Bresenham基本生成算法基础上进行局部调整.分析结果表明,该方法结构简单,且因为仅使用整数基本运算实现,因此具有快速的生成速度和较高的显示质量.     

Integer Programming Model for Maximum Clique in Graph

The maximum clique or maximum independent set of graph is a classical problem in graph theory. Combined with Boolean algebra and integer programming, two integer programming models for maximum clique problem,which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by several examples.