On a class of quadratic programs
We consider a class of quadratic programs where the constraints are linear and the objective is a product of two linear functions. Assuming the two linear factors to be nonnegative, maximization and minimization cases are considered. Each case is analyzed with the help of a bicriteria linear program obtained by replacing the quadratic objective with the two linear functions. Global minimum [maximum] is attained at an efficient extreme point [efficient point] of the feasible set in the solution space and corresponds to an efficient extreme point [efficient point] of the feasible set in the bicriteria space. Utilizing this fact and certain other properties, two finite algorithms, including validations are given for solving the respective problems. Each of these, essentially, consists of solving a sequence of linear programs. Finally, a method is provided for relaxing the nonnegativity assumption on the two linear factors of the objective function.
- A finite algorithm for a class of nonlinear multiplicative programs
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- scientific article; zbMATH DE number 592643
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- scientific article; zbMATH DE number 4070204
- Bicriteria Transportation Problem
- Decomposition principle for indefinite quadratic programe
- scientific article; zbMATH DE number 3466822 (Why is no real title available?)
- scientific article; zbMATH DE number 3227649 (Why is no real title available?)
- scientific article; zbMATH DE number 3231716 (Why is no real title available?)
- scientific article; zbMATH DE number 3231717 (Why is no real title available?)
- scientific article; zbMATH DE number 3356443 (Why is no real title available?)
- Note on the paper of H. Amato und G. Mensch: Rank restriction on the quadratic form in indefinite quadratic programming
- On factored quadratic functions
- Rank restrictions on the quadratic form in indefinite quadratic programming
- Three remarks about two papers on quadratic forms
- On lower bounds for a class of quadratic 0,1 programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Reduction of indefinite quadratic programs to bilinear programs
- A solvable class of quadratic 0-1 programming
- 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
- A generalized problem of quadratic programming
- On quadratic and complete quadratic problems of convex programming
- Generalized linear multiplicative and fractional programming
- Quadratic bottleneck knapsack problems
- On linear multiplicative programming.
- \(NP\)-hardness of linear multiplicative programming and related problems
- Level set algorithm for solving convex multiplicative programming problems
- Branch and cut method for solving integer indefinite quadratic bilevel programs
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- On a linear-quadratic problem with Caputo derivative
- scientific article; zbMATH DE number 3970535 (Why is no real title available?)
- Quadratic programming analogs
- An algorithm for piece-wise indefinite quadratic programming problem
- scientific article; zbMATH DE number 6263004 (Why is no real title available?)
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Linear fractional optimization for integer indefinite quadratic fractional problem
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Some properties on quadratic infinite programs of integral type
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
This page was built for publication: On a class of quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080777)