We address systems which have multiple objectives: broadly speaking, these objectives can be thought of as safety and performance goals. Guaranteeing safety is our rst priority, satisfying performance criteria our second. In this paper, we compute the system's safe operating space and represent it in closed form, and then, within this space, we compute solutions which optimize a given performan...

The aim of this work is to propose a mathematical programming model for the Economic Lot Scheduling Problem (ELSP) with performance decay. The main difficulties related to this model are the nonlinearities and/or nonconvexities associated with the dynamic behavior of the system with time. Firstly, the problem is formulated as a Mixed Integer Non Linear Program (MINLP), which is found to be nonc...

Abstract : Two new methodologies for the global optimization of MINLP models, the Special structure Mixed Integer Nonlinear BB, SMIN– BB, and the General structure Mixed Integer Nonlinear BB, GMIN– BB, are presented. Their theoretical foundations provide guarantees that the global optimum solution of MINLPs involving twice–differentiable nonconvex functions in the continuous variables can be id...

Discrete-continuous non-linear optimization models are frequently used to formulate problems in process system engineering. Major modeling alternatives and solution algorithms include generalized disjunctive programming and mixed integer non-linear programming (MINLP). Both have advantages and drawbacks depending on the problem they are dealing with. In this work, we describe the theory behind ...

We are interested in methods to solve mixed-integer nonlinear optimal control problems (MIOCPs) constrained by ordinary differential equations and combinatorial constraints on some of the control functions. To solve these problems we use a first discretize, then optimize approach to get a specially structured mixed-integer nonlinear program (MINLP). We decompose this MINLP into an NLP and an MI...

An extended version of Kelley’s cutting plane method is introduced in the present paper. The extended method can be applied for the solution of convex MINLP (mixed-integer non-linear programming) problems, while Kelley’s cutting plane method was originally introduced for the solution of convex NLP (non-linear programming) problems only. The method is suitable for solving large convex MINLP prob...

This paper presents a multi-objective and multi-service location-allocation model with capacity planning to design a healthcare facilities network through considering a referral system. Therefore, a mixed integer nonlinear programming (MINLP) model containing two objective functions is proposed. The first objective function is  relates to minimization of total opening cost, minimization of tota...

This paper proposes optimal operational planning for cogeneration system (CGS) using particle swarm optimization (PSO). CGS is usually connected to various facilities such as refrigerators, reservoirs, and cooling towers. In order to generate optimal operational planning for CGS, startup/shutdown status and/or input/output values of the facilities for each control interval should be determined....

In this letter, we aim to maximize the minimum data volume for energy harvest (EH)-based D2D communication underlaying cellular network. The formulated problem is a mixed integer nonlinear programming (MINLP), which split into two sub-problems solve separately. We first employ Successive Convex Approximation (SCA) method time and power allocation, while putting spectrum multiplexed pairs as fix...

In this work we propose a simultaneous scheduling and control optimization formulation to address both optimal steady-state production and dynamic product transitions in multiproduct parallel continuous stirred tank reactors. The simultaneous scheduling and control problem for multiproduct parallel continuous reactors is cast as a Mixed-Integer Dynamic Optimization (MIDO) problem. The reactor d...