Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations

Autores
Vecchietti, Aldo; Lee, Sangbum; Grossmann, Ignacio E.
Año de publicación
2003
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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 Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixed-integer space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method.
Fil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Lee, Sangbum. University of Carnegie Mellon; Estados Unidos
Fil: Grossmann, Ignacio E.. University of Carnegie Mellon; Estados Unidos
Materia
BIG-M RELAXATION
CONVEX HULL RELAXATION
DISCRETE-CONTINUOUS OPTIMIZATION
GENERALIZED DISJUNCTIVE PROGRAMMING
MIXED-INTEGER NONLINEAR PROGRAMMING
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/138542
Acceder
id CONICETDig_113e9e9c863f489f96b5109dced72f8d
oai_identifier_str oai:ri.conicet.gov.ar:11336/138542
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxationsVecchietti, AldoLee, SangbumGrossmann, Ignacio E.BIG-M RELAXATIONCONVEX HULL RELAXATIONDISCRETE-CONTINUOUS OPTIMIZATIONGENERALIZED DISJUNCTIVE PROGRAMMINGMIXED-INTEGER NONLINEAR PROGRAMMINGhttps://purl.org/becyt/ford/2.4https://purl.org/becyt/ford/2This 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 Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixed-integer space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method.Fil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; ArgentinaFil: Lee, Sangbum. University of Carnegie Mellon; Estados UnidosFil: Grossmann, Ignacio E.. University of Carnegie Mellon; Estados UnidosPergamon-Elsevier Science Ltd2003-03-15info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/138542Vecchietti, Aldo; Lee, Sangbum; Grossmann, Ignacio E.; Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 27; 3; 15-3-2003; 433-4480098-13541873-4375CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/S0098-1354(02)00220-Xinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S009813540200220Xinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T10:03:52Zoai:ri.conicet.gov.ar:11336/138542instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 10:03:53.069CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
title Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
spellingShingle Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
Vecchietti, Aldo
BIG-M RELAXATION
CONVEX HULL RELAXATION
DISCRETE-CONTINUOUS OPTIMIZATION
GENERALIZED DISJUNCTIVE PROGRAMMING
MIXED-INTEGER NONLINEAR PROGRAMMING
title_short Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
title_full Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
title_fullStr Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
title_full_unstemmed Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
title_sort Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations
dc.creator.none.fl_str_mv Vecchietti, Aldo
Lee, Sangbum
Grossmann, Ignacio E.
author Vecchietti, Aldo
author_facet Vecchietti, Aldo
Lee, Sangbum
Grossmann, Ignacio E.
author_role author
author2 Lee, Sangbum
Grossmann, Ignacio E.
author2_role author
author
dc.subject.none.fl_str_mv BIG-M RELAXATION
CONVEX HULL RELAXATION
DISCRETE-CONTINUOUS OPTIMIZATION
GENERALIZED DISJUNCTIVE PROGRAMMING
MIXED-INTEGER NONLINEAR PROGRAMMING
topic BIG-M RELAXATION
CONVEX HULL RELAXATION
DISCRETE-CONTINUOUS OPTIMIZATION
GENERALIZED DISJUNCTIVE PROGRAMMING
MIXED-INTEGER NONLINEAR PROGRAMMING
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.4
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv 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 Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixed-integer space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method.
Fil: Vecchietti, Aldo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo y Diseño. Universidad Tecnológica Nacional. Facultad Regional Santa Fe. Instituto de Desarrollo y Diseño; Argentina
Fil: Lee, Sangbum. University of Carnegie Mellon; Estados Unidos
Fil: Grossmann, Ignacio E.. University of Carnegie Mellon; Estados Unidos
description 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 Disjunctive Programming (GDP), or hybrid models. Characterization and properties are presented for various types of disjunctions. An interesting result is presented for improper disjunctions where results in the continuous space differ from the ones in the mixed-integer space. A cutting plane method is also proposed that avoids the explicit generation of equations and variables of the convex hull. Several examples are presented throughout the paper, as well as a small process synthesis problem, which is solved with the proposed cutting plane method.
publishDate 2003
dc.date.none.fl_str_mv 2003-03-15
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/138542
Vecchietti, Aldo; Lee, Sangbum; Grossmann, Ignacio E.; Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 27; 3; 15-3-2003; 433-448
0098-1354
1873-4375
CONICET Digital
CONICET
url http://hdl.handle.net/11336/138542
identifier_str_mv Vecchietti, Aldo; Lee, Sangbum; Grossmann, Ignacio E.; Modeling of discrete/continuous optimization problems: Characterization and formulation of disjunctions and their relaxations; Pergamon-Elsevier Science Ltd; Computers and Chemical Engineering; 27; 3; 15-3-2003; 433-448
0098-1354
1873-4375
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.1016/S0098-1354(02)00220-X
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S009813540200220X
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269825493106688
score 13.13397

Publicaciones similares