A continuous strategy to solve a class of mixed optimization problems
From MaRDI portal
Recommendations
- A continuous strategy to solve a class of discrete optimization problems
- An optimization method for solving mixed discrete-continuous programming problems
- An exact penalty function method for nonlinear mixed discrete programming problems
- Global optimization for generalized geometric programs with mixed free-sign variables
- Global optimization for generalized geometric programming problems with discrete variables
Cites work
- scientific article; zbMATH DE number 3537446 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- A deterministic global optimization algorithm for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A new rectangle branch-and-pruning approach for generalized geometric programming
- Global optimization of signomial geometric programming using linear relaxation.
- Investigation of path-following algorithms for signomial geometric programming problems
- On the mixed integer signomial programming problems
Cited in
(3)
This page was built for publication: A continuous strategy to solve a class of mixed optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496673)