Computing a global optimal solution to a design centering problem

DOI10.1007/BF01585697MaRDI QIDQ1184340zbMATH OpenOpenAlexFDO

Authors V. H. Nguyen, Jean-Jacques Strodiot

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

zbMATH Keywords

d.c. programmingdiamond cuttingglobal optimizationnondifferentiable optimizationthree- dimensional design centering

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30) Applications of mathematical programming (90C90)

Recommendations

• The design centering problem as a d.c. programming problem
• scientific article; zbMATH DE number 4131966
• scientific article; zbMATH DE number 4064775
• scientific article; zbMATH DE number 3892947
• Solving polyhedral d.c. optimization problems via concave minimization

Cites work

• A modified version of Tuy's method for solving d.c. programing problem
• Convex Analysis
• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 4011808 (Why is no real title available?)
• Linear programs with an additional reverse convex constraint
• Optimal coverage of convex regions
• The design centering problem as a d.c. programming problem

Cited in

(19)

• The design centering problem as a d.c. programming problem
• On solving a d.c. programming problem by a sequence of linear programs
• Applications of interval arithmetic in non-smooth global optimization
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
• DC programming: overview.
• How to solve a semi-infinite optimization problem
• Convex maximization formulation of general sphere packing problem
• How to solve a design centering problem
• The \(C_ M\)-embedded problem and optimality conditions
• Extracting maximal objects from three-dimensional solid materials
• A semi-infinite approach to design centering
• A collision detection approach for maximizing the material utilization
• Recent advances in nonconvex semi-infinite programming: applications and algorithms
• Optimal control sphere packing problem
• A global approach for generalized semi-infinite programs with polyhedral parameter sets
• On generalized semi-infinite programming. (With comments and rejoinder).
• Generalized semi-infinite programming: a tutorial
• Application of general semi-infinite programming to lapidary cutting problems

This page was built for publication: Computing a global optimal solution to a design centering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184340)