On a class of quadratic programs
From MaRDI portal
Publication:1080777
DOI10.1016/0377-2217(84)90262-5zbMath0599.90094MaRDI QIDQ1080777
Publication date: 1984
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(84)90262-5
linear constraints; bicriteria linear program; efficient extreme point; product of two linear functions
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C31: Sensitivity, stability, parametric optimization
Related Items
An outer approximation method for minimizing the product of several convex functions on a convex set, Parametric simplex algorithms for solving a special class of nonconvex minimization problems, A global optimization approach for solving the convex multiplicative programming problem, Polyhedral annexation, dualization and dimension reduction technique in global optimization, A parametric successive underestimation method for convex multiplicative programming problems, Linear multiplicative programming, Global minimization of a generalized convex multiplicative function, Convex programs with an additional constraint on the product of several convex functions, Multiplicative programming problems: Analysis and efficient point search heuristic, \(NP\)-hardness of linear multiplicative programming and related problems
