Reversed geometric programming: A branch-and-bound method involving linear subproblems
From MaRDI portal
Cites work
- A modified reduced gradient method for a class of nondifferentiable problems
- A set of geometric programming test problems and their solutions
- An Algorithm for Separable Nonconvex Programming Problems
- An Easy Primal Method for Geometric Programming
- Constrained derivatives and equilibrium conditions in generalized geometric programming
- Geometric programming with signomials
- Global solutions of mathematical programs with intrinsically concave functions
- scientific article; zbMATH DE number 3466845 (Why is no real title available?)
- scientific article; zbMATH DE number 3453355 (Why is no real title available?)
- scientific article; zbMATH DE number 3308855 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- Solution of generalized geometric programs
Cited in
(3)
This page was built for publication: Reversed geometric programming: A branch-and-bound method involving linear subproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1141082)