Global Maximization of a Convex Function with Linear Inequality Constraints
From MaRDI portal
Publication:4085500
DOI10.1287/opre.22.3.602zbMath0322.90049OpenAlexW2085844492MaRDI QIDQ4085500
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.3.602
Related Items
Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, An algorithm for optimizing over the weakly-efficient set, A weighting method for 0-1 indefinite quadratic bilevel programming, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, Using convex envelopes to solve the interactive fixed-charge linear programming problem, On the structure and properties of a linear multilevel programming problem, An Algorithm for Maximizing a Convex Function Based on Its Minimum, A decomposition approach for global optimum search in QP, NLP and MINLP problems, On a class of functions attaining their maximum at the vertices of a polyhedron, Convex Maximization via Adjustable Robust Optimization, A general purpose exact solution method for mixed integer concave minimization problems, Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints, Normal conical algorithm for concave minimization over polytopes, Optimization over the efficient set, Minimization of a quasi-concave function over an efficient set, Linear multiplicative programming, Maximization of A convex quadratic function under linear constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, A convergent conical algorithm with \(\omega \)-bisection for concave minimization, On the convergence of cone splitting algorithms with \(\omega\)-subdivisions, Separable concave minimization via partial outer approximation and branch and bound, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Maximization of linearly constrained posynomials, On the nonlinear multilevel programming problems, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Subdeterminants and Concave Integer Quadratic Programming, An exact penalty on bilevel programs with linear vector optimization lower level, Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual, On Non Overlapping Segmentation of the Response Surfaces for Solving Constrained Programming Problems Through Super Convergent Line Series, Nonlinear programming: Global use of the Lagrangian, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, A heuristic for the continuous capacity and flow assignment
