Pages that link to "Item:Q4119020"

The following pages link to Variations on a cutting plane method for solving concave minimization problems with linear constraints (Q4119020):

Displaying 13 items.

• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
• On the global minimization of concave functions (Q800693) (← links)
• Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
• An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
• A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← 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)
• Linear multiplicative programming (Q1207311) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• A combined cutting-stock and lot-sizing problem (Q1969834) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)