This is a preview. Log in through your library . Abstract We provide an abstract principle aimed at proving that classes of optimization problems are typically well posed in the sense that the ...
An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...
Abstract: There are many combinatorial optimization problems derived from the classic traveling salesman problem (TSP). The quadratic traveling salesman problem (QTSP) is one of them. It needs to ...
This paper proposes an exact method to solve an integer indefinite quadratic bilevel problem with multiple objectives at the upper level, where the objective functions at both levels are a product of ...
Abstract: In general, the motion control problem of redundant robot manipulators (RRMs) can be transformed into a constrained time-varying quadratic programming (TVQP) problem. Recently, various ...
The NLP procedure (NonLinear Programming) offers a set of optimization techniques for minimizing or maximizing a continuous nonlinear function f(x) of n decision variables, x = (x 1, ... ,x n) T with ...
An operations research technique that solves problems in which an optimal value is sought subject to specified constraints. Mathematical programming models include linear programming, quadratic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback