Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Global Optimization"
DOI: 10.1007/s10898-019-00764-3
Abstract: Discretization-based algorithms are proposed for the global solution of mixed-integer nonlinear generalized semi-infinite (GSIP) and bilevel (BLP) programs with lower-level equality constraints coupling the lower and upper level. The algorithms are extensions, respectively, of the… read more here.
Keywords: equality; level; discretization based; equality constraints ... See more keywords
3D Quantification for Aggregate Morphology Using Surface Discretization Based on Solid Modeling
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Materials in Civil Engineering"
DOI: 10.1061/(asce)mt.1943-5533.0002766
Abstract: AbstractSphericity, form dimensions, and angularity are important morphological properties of aggregates that significantly affect the microstructure of grain-based materials and their macromechani... read more here.
Keywords: morphology using; surface discretization; aggregate morphology; quantification aggregate ... See more keywords
Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Letters"
DOI: 10.48550/arxiv.2207.03699
Abstract: Discretization-based methods have been proposed for solving nonconvex optimization problems with bilinear terms such as the pooling problem. These methods convert the original nonconvex optimization problems into mixed-integer linear programs (MILPs). In this paper we… read more here.
Keywords: models pooling; milp models; pooling problem; bilinear terms ... See more keywords