Mathematical programs with a two-dimensional reverse convex constraint
From MaRDI portal
Publication:1186268
DOI10.1007/BF00119988zbMath0754.90046OpenAlexW2092052248MaRDI QIDQ1186268
Phan Thien Thach, Rainer E. Burkard, Werner Oettli
Publication date: 28 June 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00119988
Related Items (12)
Linear programs with an additional rank two reverse convex constraint ⋮ Convex programs with an additional constraint on the product of several convex functions ⋮ Combinatorial algorithms for some 1-facility median problems in the plane ⋮ Constraint decomposition algorithms in global optimization ⋮ Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type ⋮ A generalized duality and applications ⋮ An outer approximation method for minimizing the product of several convex functions on a convex set ⋮ An algorithm for solving convex programs with an additional convex- concave constraint ⋮ Some further duality theorems for optimization problems with reverse convex constraint sets ⋮ Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions ⋮ Branch-and-reduce algorithm for convex programs with additional multiplicative constraints ⋮ A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- On outer approximation methods for solving concave minimization problems
- Convex programs with an additional reverse convex constraint
- Convex programs with several additional reverse convex constraints
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Linear multiplicative programming
- Generalized linear multiplicative and fractional programming
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- On the complexity of four polyhedral set containment problems
- A modified version of Tuy's method for solving d.c. programing problem
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
This page was built for publication: Mathematical programs with a two-dimensional reverse convex constraint