Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
From MaRDI portal
Publication:5580062
DOI10.1287/opre.18.1.82zbMath0186.24201OpenAlexW2099408765MaRDI QIDQ5580062
Richard L. Francis, A. Victor Cabot
Publication date: 1970
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.18.1.82
Related Items
A weighting method for 0-1 indefinite quadratic bilevel programming, Maximizing pseudoconvex transportation problem: A special type, Extreme point Quadratic Minimization Problem, Enumerative techniques for solving some nonconvex global optimization problems, An algorithm for indefinite integer quadratic programming, Jointly constrained bilinear programs and related problems: An overview, Models and methods of solution of quadratic integer programming problems, Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem, Computational approaches to variance-penalised Markov decision processes, Mixed-integer bilinear programming problems, On the indefinite quadratic bilevel programming problem., Linear multiplicative programming, A cutting plane algorithm for solving bilinear programs, Maximization of A convex quadratic function under linear constraints, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, Using shortest paths in some transshipment problems with concave costs, An algorithm for determining all extreme points of a convex polytope, Maximization of linearly constrained posynomials, On the nonlinear multilevel programming problems, An algorithm for a class of nonlinear fractional problems using ranking of the vertices, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, Die Lösung eines nichtlinearen Investitionsproblems mit Hilfe binärer Optimierungsalgorithmen — gezeigt am Beispiel der Planung regionaler Abwasserbehandlungssysteme, A mathematical programming approach to a problem in variance penalised Markov decision processes, Global optimization algorithms for linearly constrained indefinite quadratic problems