Pages that link to "Item:Q3040932"

The following pages link to Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain (Q3040932):

Displaying 27 items.

• Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
• Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
• The filled function transformations for constrained global optimization (Q751199) (← links)
• On the global minimization of concave functions (Q800693) (← 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)
• On the nonlinear multilevel programming problems (Q998684) (← links)
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
• Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
• Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
• A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
• LP-form inclusion functions for global optimization (Q1174536) (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
• Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
• A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
• A new technique for generating quadratic programming test problems (Q1315416) (← links)
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
• A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
• A generalization of the construction of test problems for nonconvex optimization (Q1330804) (← links)
• Construction of large-scale global minimum concave quadratic test problems (Q2265952) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• Computational experience using an edge search algorithm for linear reverse convex programs (Q2564611) (← links)
• Sufficient optimality criterion for linearly constrained, separable concave minimization problems (Q2569195) (← links)
• A decomposition approach for global optimum search in QP, NLP and MINLP problems (Q2638940) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)