A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
From MaRDI portal
Publication:1890947
DOI10.1007/BF01106607zbMath0835.90096OpenAlexW1967114472MaRDI QIDQ1890947
Thai Quynh Phong, Hoai An Le Thi, Tao Pham Dinh
Publication date: 15 April 1996
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01106607
global optimizationd.c. programmingouter approximation\((\varepsilon,\eta)\)-solutionfuel mixture problem
Related Items (5)
An algorithm for solving general D. C. programming problems ⋮ A robust algorithm for quadratic optimization under quadratic constraints ⋮ Large-scale standard pooling problems with constrained pools and fixed demands ⋮ Exact penalty and error bounds in DC programming ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concave minimization via conical partitions and polyhedral outer approximation
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- A method for solving reverse convex programming problems
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- On-line and off-line vertex enumeration by adjacency lists
- Computing a global optimal solution to a design centering problem
- On solving a d.c. programming problem by a sequence of linear programs
- D.c sets, d.c. functions and nonlinear equations
- On solving general reverse convex programming problems by a sequence of linear programs and line searches
- Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Global minimization of a difference of two convex functions
- A modified version of Tuy's method for solving d.c. programing problem
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- A Successive Underestimation Method for Concave Minimization Problems
This page was built for publication: A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
