Pages that link to "Item:Q4082541"
From MaRDI portal
The following pages link to Complementary Geometric Programming (Q4082541):
Displaying 40 items.
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- A level set algorithm for a class of reverse convex programs (Q751513) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- Fuzzy geometric programming with several objective functions (Q914557) (← links)
- Global optimization for special reverse convex programming (Q931747) (← links)
- Convexity of products of univariate functions and convexification transformations for geometric programming (Q1014014) (← links)
- Convex programs with an additional reverse convex constraint (Q1071651) (← links)
- On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
- Reverse convex programming (Q1147072) (← links)
- A penalty treatment of equality constraints in generalized geometric programming (Q1158346) (← links)
- Discrete solutions to engineering design problems (Q1213829) (← links)
- A dual formulation for generating information about constrained optima in automated design (Q1216363) (← links)
- Application of optimization methods to the hematological support of patients with disseminated malignancies (Q1220440) (← links)
- Comparison of generalized geometric programming algorithms (Q1243238) (← links)
- Transcendental geometric programs (Q1243241) (← links)
- Optimal design of a dry-type natural-draft cooling tower by geometric programming (Q1243247) (← links)
- Current state of the art of algorithms and computer software for geometric programming (Q1243249) (← links)
- On condensed geometric programming in structural optimisation (Q1247922) (← links)
- Investigation of path-following algorithms for signomial geometric programming problems (Q1280139) (← links)
- Construction of test problems for a class of reverse convex programs (Q1331094) (← links)
- On the posynomial fractional programming problems (Q1848628) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- A modified convace simplex algorithm for geometric programming (Q2265341) (← links)
- An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
- A nonisolated optimal solution for special reverse convex programming problems (Q2519714) (← links)
- Computational experience using an edge search algorithm for linear reverse convex programs (Q2564611) (← links)
- An alternative linearization technique (Q2721500) (← links)
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
- Optimal service of equipments in a production system (Q3683869) (← links)
- Multiobjective optimization of a queueing system (Q3727692) (← links)
- (Q3730359) (← links)
- (Q3911640) (← links)
- On “a cofferdam design optimization” (Q4085523) (← links)
- A condensation method for generalized geometric programming (Q4124628) (← links)
- An iterative convex simplex method for geometric programming with applications† (Q4140746) (← links)
- Computational aspects of cutting-plane algorithms for geometric programming problems (Q4149242) (← links)
- Successive search methods for solving a canonical DC programming problem (Q5413891) (← links)
- The proximity of (algebraic) geometric programming to linear programming (Q5657903) (← links)