Buscar
Mostrando ítems 1-10 de 509
Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
(Pergamon-Elsevier Science Ltd, 2003-03-15)
This paper addresses the relaxations in alternative models for disjunctions, big-M and convex hull model, in order to develop guidelines and insights when formulating Mixed-Integer Non-Linear Programming (MINLP), Generalized ...
Valid inequalities for Lagrangian relaxation in an inventory location problem with stochastic capacity
(PERGAMON-ELSEVIER SCIENCE LTD, 2008)
We developed an efficient heuristic to solve a joint location-distribution-inventory model for a three layered supply chain. A firm must locate distribution centers to supply a commodity to spatially distributed retailers ...
A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
(Elsevier Science BvAmsterdamHolanda, 2006)
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
(Pergamon-Elsevier B.V. Ltd, 2010-04-01)
The production planning of regional small-scale soft drink plants can be modeled by mixed integer models that integrate lot sizing and scheduling decisions and consider sequence-dependent setup times and costs. These plants ...
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
(Pergamon-Elsevier B.V. Ltd, 2010-04-01)
The production planning of regional small-scale soft drink plants can be modeled by mixed integer models that integrate lot sizing and scheduling decisions and consider sequence-dependent setup times and costs. These plants ...
A New Multicommodity Flow Model for the Job Sequencing and Tool Switching Problem
(Taylor & Francis, 2020)
In this paper a new multicommodity flow mathematical model for the Job Sequencing and Tool Switching Problem (SSP) is presented. The proposed model has a LP relaxation lower bound equal to the number of tools minus the ...
Relaxed convex model for optimal location and sizing of DGs in DC grids using sequential quadratic programming and random hyperplane approaches
(Elsevier Ltd, 2020)
This report addresses the problem of optimal location and sizing of constant power sources (distributed generators (DGs)) in direct current (DC) networks for improving network performance in terms of voltage profiles and ...
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
(Pergamon-Elsevier B.V. Ltd, 2014)
Convergent LMI Relaxations for Quadratic Stabilizability and H-infinity Control of Takagi-Sugeno Fuzzy Systems
(Ieee-inst Electrical Electronics Engineers IncPiscatawayEUA, 2009)
Interior point algorithm for linear programming used in transmission network synthesis
(Elsevier B.V., 2005-09-01)
This article presents a well-known interior point method (IPM) used to solve problems of linear programming that appear as sub-problems in the solution of the long-term transmission network expansion planning problem. The ...