Computing a global optimal solution to a design centering problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 4011808 (Why is no real title available?)
- A modified version of Tuy's method for solving d.c. programing problem
- Convex Analysis
- 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
(18)- DC programming: overview.
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Convex maximization formulation of general sphere packing problem
- Application of general semi-infinite programming to lapidary cutting problems
- A semi-infinite approach to design centering
- On solving a d.c. programming problem by a sequence of linear programs
- The \(C_ M\)-embedded problem and optimality conditions
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- Generalized semi-infinite programming: a tutorial
- Applications of interval arithmetic in non-smooth global optimization
- Extracting maximal objects from three-dimensional solid materials
- The design centering problem as a d.c. programming problem
- A collision detection approach for maximizing the material utilization
- How to solve a semi-infinite optimization problem
- How to solve a design centering problem
- Optimal control sphere packing problem
- On generalized semi-infinite programming. (With comments and rejoinder).
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
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)
