Complementary Geometric Programming

Cited In (40)

An alternative linearization technique
Current state of the art of algorithms and computer software for geometric programming
Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
On condensed geometric programming in structural optimisation
Construction of test problems for a class of reverse convex programs
A condensation method for generalized geometric programming
Transcendental geometric programs
Multiobjective optimization of a queueing system
On “a cofferdam design optimization”
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
Global optimization for special reverse convex programming
Title not available (Why is that?)
On generalized geometric programming problems with non-positive variables
Reverse convex programming
Optimal design of a dry-type natural-draft cooling tower by geometric programming
A penalty treatment of equality constraints in generalized geometric programming
On the global minimization of a convex function under general nonconvex constraints
Comparison of generalized geometric programming algorithms
On the posynomial fractional programming problems
Convex programs with an additional reverse convex constraint
Multi-parametric disaggregation technique for global optimization of polynomial programming problems
A level set algorithm for a class of reverse convex programs
An iterative convex simplex method for geometric programming with applications†
Computational aspects of cutting-plane algorithms for geometric programming problems
Successive search methods for solving a canonical DC programming problem
Convexity of products of univariate functions and convexification transformations for geometric programming
Fuzzy geometric programming with several objective functions
A nonisolated optimal solution for special reverse convex programming problems
Title not available (Why is that?)
Computational experience using an edge search algorithm for linear reverse convex programs
Optimal service of equipments in a production system
On the use of cuts in reverse convex programs
A modified convace simplex algorithm for geometric programming
The proximity of (algebraic) geometric programming to linear programming
Discrete solutions to engineering design problems
A dual formulation for generating information about constrained optima in automated design
Application of optimization methods to the hematological support of patients with disseminated malignancies
An efficient convexification method for solving generalized geometric problems
Investigation of path-following algorithms for signomial geometric programming problems
A finite cutting plane method for solving linear programs with an additional reverse convex constraint

This page was built for publication: Complementary Geometric Programming

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