Results 291 to 300 of about 184,637 (335)

A parameterized hessian quadratic programming problem

Annals of Operations Research, 1986
We present a general active set algorithm for the solution of a convex quadratic programming problem having a parametrized Hessian matrix. The parametric Hessian matrix is a positive semidefinite Hessian matrix plus a real parameter multiplying a symmetric matrix of rank one or two.
M. J. Best, R. J. Caron
openaire   +1 more source

Should Quadratic Programming Problems Be Approximated?

American Journal of Agricultural Economics, 1982
Quadratic programming problems appear often in agricultural economics literature. However, approximations to quadratic programs also appear often. This note discusses whether quadratic programming problems should be approximated or solved directly. Several items need to be considered.
Bruce A. McCarl, Thomas Tice
openaire   +2 more sources

Ranking in quadratic integer programming problems

European Journal of Operational Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gupta, Renu, Bandopadhyaya, Lakshmisree, Puri, M. C.   +2 more
openaire   +1 more source

Fuzzy costs in quadratic programming problems

Fuzzy Optimization and Decision Making, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Silva, Ricardo C., Cruz, Carlos, Verdegay, José L.   +2 more
openaire   +1 more source

Quadratic programming algorithms for obstacle problems

Communications in Numerical Methods in Engineering, 1996
Summary: The numerical solution of problems involving frictionless contact between an elastic body and a rigid obstacle is considered. The elastic body may undergo small or large deformation. Finite element discretization and repetitive linearization lead to a sequence of quadratic programming (QP) problems for incremental displacement.
Doukhovni, Ilia, Givoli, Dan
openaire   +2 more sources

The Linear-Quadratic Bilevel Programming Problem

INFOR: Information Systems and Operational Research, 1994
AbstractRecently we have developed a Sequential LCP (SLCP) algorithm for the solution of the Linear Bilevel Programming Problem (LBLP). The SLCP algorithm consists of solving a sequence of Linear Complementarity Problems (LCP) by a hybrid enumerative method.
J.J. Júdice, A. Faustino
openaire   +1 more source

Extreme point quadratic fractional programming problem

Optimization, 1994
In the present paper an extreme point quadratic fractional programming problem is studied, in which objective is to minimize a quadratic fractional functional subject to a general set of constraints with the additional restriction that it has to be an extreme point of a convex polytope.
R. Gupta1and, M. C. Puri
openaire   +1 more source

Parametric linear programming techniques for the indefnite quadratic programming problem

IMA Journal of Management Mathematics, 1992
The authors present a multiparametric algorithm to find a global minimum for a class of indefinite quadratic programming problems. Based on the spectral decomposition of the matrix of the quadratic form, an indefinite quadratic programming problem is transformed into a multi-parametric linear programming problem, where the parameters appear in both ...
Vicente, Luís N., Júdice, Joaquim J., Pardalos, Panos M.   +2 more
openaire   +2 more sources

Quadratic programs in frictionless contact problems

International Journal of Engineering Science, 1986
The present study is concerned with a systematization of the finite dimensional vector-matrix representation of linear elastic contact problems. Six different minimum principles, in the form of quadratic programs (QPs), are derived and the duality theory of QPs is used to obtain relations between them.
openaire   +1 more source

Quadratic programming problems and related linear complementarity problems

Journal of Optimization Theory and Applications, 1990
This paper investigates the general quadratic programming problem, i.e., the problem of finding the minimum of a quadratic function subject to linear constraints. In the case that, over the set of feasible points, the objective function is bounded from below, this problem can be solved by the minimization of a linear function, subject to the solution ...
openaire   +2 more sources