LP-form inclusion functions for global optimization

DOI10.1016/0898-1221(91)90160-6zbMath0735.65039OpenAlexW2029709741MaRDI QIDQ1174536

Stuart G. Mentzer

Publication date: 25 June 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90160-6

zbMATH Keywords

global optimizationlinear programspartial monotonicitybranch-and-bound methodsLP-form inclusion functionspolyhedral envelope

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• Global optimization using interval analysis - the multi-dimensional case
• On computing the range of a rational function of n variables over a bounded region
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• An algorithm for nonconvex programming problems
• An Algorithm for Separable Nonconvex Programming Problems
• On Solving Systems of Equations Using Interval Arithmetic
• Sequential Minimax Search for a Maximum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: LP-form inclusion functions for global optimization