Results 191 to 200 of about 7,645,857 (241)

An Iterative Algorithm for Fuzzy Quadratic Programming Problems

2006
This paper describes an interactive algorithm for fuzzy non linear programming problems. Based on some general results, an iterative algorithm is proposed, which modifies the admissible region in such a way as to increase at each step the global performance.
openaire   +3 more sources

A Dynamic-Programming Bound for the Quadratic Assignment Problem

1999
The quadratic assignment problem (QAP) is the NP-complete optimization problem of assigning n facilities to n locations while minimizing certain costs. In practice, proving the optimality of a solution is hard even for moderate problem sizes with n ≅ 20. We present a new algorithm for solving the QAP.
Ambros Marzetta, Adrian Brüngger
openaire   +2 more sources

Sequential Quadratic Programming for Parameter Identification Problems

IFAC Proceedings Volumes, 1989
Abstract Sequential quadratic programming (SQP) is a technique for nonlinear equality constrained minimization problems, which, from the point of view of local convergence, is equivalent to finding a root of the gradient of the Lagrangian by Newton's method, if the second order sufficient conditions hold. For general, unstructured, finite dimensional
D.M. Hwang, C.T. Kelley
openaire   +1 more source

Quadratic programming and combinatorial minimum weight product problems

Mathematical Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kern, Walter, Woeginger, Gerhard
openaire   +7 more sources

A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem

Knowledge-Based Systems, 2018
Ying Zhou, Jiahai Wang, Zi-Yan Wu, Keke Wu   +3 more
semanticscholar   +1 more source

Algebraic Solution of the Problems of Nonconvex Quadratic Programming

Automation and Remote Control, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A new algorithm for resolution of the quadratic programming problem with fuzzy relation inequality constraints

Computers & industrial engineering, 2014
A. A. Molai
semanticscholar   +1 more source

Local minimizer of a nonconvex quadratic programming problem

Computing, 1990
A modified Beale's algorithm is described which computes the local minimizer of any quadratic objective function subject to linear constraints. Some extensions are given, first of all the possibility of movement to the neighbouring local minimizer with a reduced objective function value in some special cases.
openaire   +1 more source

Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem

Computers & Operations Research, 2014
A. Duarte, M. Laguna, R. Martí, J. Sánchez-Oro   +3 more
semanticscholar   +1 more source

Solution of an integer problem of quadratic programing

Journal of Applied Mathematics and Mechanics, 1965
Dem'yanov, V. F., Khudyakov, L. Yu.
openaire   +2 more sources