Pages that link to "Item:Q1215459"

The following pages link to Quasi-concave minimization subject to linear constraints (Q1215459):

Displaying 28 items.

• Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
• A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
• On the nonlinear multilevel programming problems (Q998684) (← links)
• On generalization performance and non-convex optimization of extended \(\nu \)-support vector machine (Q1031941) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
• Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
• On the structure and properties of a linear multilevel programming problem (Q1095807) (← links)
• A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
• Quadratic programming problems and related linear complementarity problems (Q1121791) (← links)
• A finitely convergent procedure for facial disjunctive programs (Q1159568) (← links)
• A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
• Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
• Linear multiplicative programming (Q1207311) (← links)
• Minimization of ratios (Q1218786) (← links)
• Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• A vector linear programming approach for certain global optimization problems (Q1756780) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A weighting method for 0-1 indefinite quadratic bilevel programming (Q2359528) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
• Optimization of linear-convex programs (Q3835613) (← links)
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412) (← links)
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron (Q4136974) (← links)
• On measuring the inefficiency with the inner-product norm in data envelopment analysis (Q5946151) (← links)
• A general purpose exact solution method for mixed integer concave minimization problems (Q6112823) (← links)