Pages that link to "Item:Q1122325"

The following pages link to Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325):

Displaying 25 items.

• Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
• An analytical approach to global optimization (Q1181733) (← links)
• On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
• A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
• A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
• Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
• Hybrid approach for solving multiple-objective linear programs in outcome space (Q1265035) (← links)
• Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
• A quasiconcave minimization method for solving linear two-level programs (Q1318264) (← links)
• Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• On the construction of test problems for concave minimization algorithms (Q1342905) (← links)
• Can linear programs be used to test global optimization algorithms? (Q1365543) (← links)
• On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
• A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
• Implementation of reduced gradient with bisection algorithms for non-convex optimization problem via stochastic perturbation (Q1751057) (← links)
• Test problem construction for linear bilevel programming problems (Q1815062) (← links)
• Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← 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)
• On a stochastic bilevel programming problem (Q2892149) (← links)