Linear programs with an additional reverse convex constraint
From MaRDI portal
Publication:1140531
DOI10.1007/BF01442898zbMath0435.90065OpenAlexW2077102256MaRDI QIDQ1140531
Richard J. Hillestad, Stephen E. Jacobsen
Publication date: 1980
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01442898
Related Items
Variations and extension of the convex-concave procedure, Convex programs with an additional constraint on the product of several convex functions, A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem, On solving general reverse convex programming problems by a sequence of linear programs and line searches, Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems, Minimizing a quasi-concave function subject to a reverse convex constraint, On the global minimization of a convex function under general nonconvex constraints, Intersection Disjunctions for Reverse Convex Sets, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation, Duality and optimality conditions for reverse convex programs via a convex decomposition, A finite cutting plane method for solving linear programs with an additional reverse convex constraint, On the use of cuts in reverse convex programs, The Convex Hull of a Quadratic Constraint over a Polytope, DC programming: overview., Global optimization for special reverse convex programming, Computing a global optimal solution to a design centering problem, Mathematical programs with a two-dimensional reverse convex constraint, Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, A global optimization approach for the linear two-level program, Calculation of bounds on variables satisfying nonlinear inequality constraints, Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization, On solving quadratically constrained quadratic programming problem with one non-convex constraint, Unnamed Item, A nonisolated optimal solution for special reverse convex programming problems, A level set algorithm for a class of reverse convex programs, Test problem construction for linear bilevel programming problems, Convex minimization under Lipschitz constraints, Global optimization from concave minimization to concave mixed variational inequality, Computational experience using an edge search algorithm for linear reverse convex programs, New SOCP relaxation and branching rule for bipartite bilinear programs, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications, Convex programs with an additional reverse convex constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse convex programming
- An algorithm for optimizing network flow capacity under economies of scale
- Characterization of local solutions for a class of nonconvex programs
- Strictly quasi-convex (concave) functions and duality in mathematical programming
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Optimization Problems Subject to a Budget Constraint with Economies of Scale
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- An algorithm for determining all extreme points of a convex polytope
- The Validity of a Family of Optimization Methods
- Iterative Solution of Nonlinear Optimal Control Problems
