Computing a global optimal solution to a design centering problem
From MaRDI portal
Publication:1184340
DOI10.1007/BF01585697zbMath0751.90071OpenAlexW1991584096MaRDI QIDQ1184340
Jean Jacques Strodiot, Van Hien Nguyen
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585697
global optimizationd.c. programmingnondifferentiable optimizationdiamond cuttingthree- dimensional design centering
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (14)
A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem ⋮ On generalized semi-infinite programming. (With comments and rejoinder). ⋮ How to solve a design centering problem ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Applications of interval arithmetic in non-smooth global optimization ⋮ Generalized semi-infinite programming: a tutorial ⋮ DC programming: overview. ⋮ Application of general semi-infinite programming to lapidary cutting problems ⋮ A collision detection approach for maximizing the material utilization ⋮ On solving a d.c. programming problem by a sequence of linear programs ⋮ How to solve a semi-infinite optimization problem ⋮ Convex maximization formulation of general sphere packing problem
Cites Work
This page was built for publication: Computing a global optimal solution to a design centering problem
