We address the issue of computing a global minimizer AC Optimal Power Flow problem. introduce valid inequalities to strengthen Semidefinite Programming relaxation, yielding novel Conic relaxation. Leveraging these constraints, we dynamically generate Mixed-Integer Linear (MILP) relaxations, whose solutions asymptotically converge minimizers apply this iterative MILP scheme on IEEE PES PGLib [2]...

We propose an optimal design method for digital IIR filters with powers-of-two coefficients. This method is based upon the formulation of a linear optimization problem that minimizes filter’s complexity for given specifications. It is shown that by taking the logarithm to the transfer function of cascade-form IIR filters, the design problem becomes linear and can be solved by mixed integer line...

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

This paper aims to compare a two-echelon and a single-echelon distribution system. A mathematical model for the Single-Echelon Capacitated Vehicle Routing Problem (SE-CVRP) is proposed. This SE-CVRP is the counterpart of Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) introduced in the authors’ previous work. The proposed mathematical model is Mixed-Integer Non-Linear Programming (MIN...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

A standard approach to solve Mixed Integer Linear Programs is to perform a global branch and bound search through all possible combinations. Due to the hardness of the problem, this search must be closely controlled by a constraint solver which uses constraints to prune the search space in an a priori way. In this paper, we deene a new domain reduction solver which uses in a cooperative way a s...

this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

This work concerns the topological optimization problem for determining the optimal petroleum refinery configuration. We are interested in further investigating and hopefully advancing the existing optimization approaches and strategies employing logic propositions to conceptual process synthesis problems. In particular, we seek to contribute to this increasingly exciting area of chemical proce...

In this paper, we present a mixed-integer linear programming (MILP) formulation of piecewise, polyhedral relaxation (PPR) multilinear term using its convex-hull representation. Based on the PPR’s solution, also MILP whose solutions are feasible for nonconvex, equations. We then computational results showing effectiveness proposed formulations standard benchmark nonlinear programs (NLPs) with te...