Pages that link to "Item:Q1140531"

The following pages link to Linear programs with an additional reverse convex constraint (Q1140531):

Displaying 31 items.

• Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets (Q613601) (← links)
• A level set algorithm for a class of reverse convex programs (Q751513) (← links)
• Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← 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)
• Global optimization for special reverse convex programming (Q931747) (← links)
• Convex programs with an additional reverse convex constraint (Q1071651) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• Minimizing a quasi-concave function subject to a reverse convex constraint (Q1108198) (← links)
• On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
• Computing a global optimal solution to a design centering problem (Q1184340) (← links)
• Mathematical programs with a two-dimensional reverse convex constraint (Q1186268) (← links)
• A global optimization approach for the linear two-level program (Q1207038) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem (Q1741115) (← links)
• On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405) (← links)
• Test problem construction for linear bilevel programming problems (Q1815062) (← links)
• Convex minimization under Lipschitz constraints (Q1823144) (← links)
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
• DC programming: overview. (Q1969457) (← links)
• New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← 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)
• On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
• A polynomial-time algorithm for a nonconvex chance-constrained program under the normal approximation (Q2688910) (← links)
• Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization (Q3030594) (← links)
• Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
• Duality and optimality conditions for reverse convex programs via a convex decomposition (Q6183466) (← links)