Results 31 to 40 of about 7,645,857 (241)
Pooling problem: Alternate formulations and solution methods [PDF]
, 2004 Copyright @ 2004 INFORMSThe pooling problem, which is fundamental to the petroleum industry, describes a situation in which products possessing different attribute qualities are mixed in a series of pools in such a way that the attribute qualities of the
Brimberg, J +9 more
core +1 more source
Measurement + Control, 2020 An improved constrained predictive functional control for the pressure of a coke furnace is proposed in this article. In conventional constrained model predictive control, a quadratic programming problem is usually constructed to replace the original ...
Sheng Wu, Pingzhi Hou, Hongbo Zou
doaj +1 more source
Gap inequalities for non-convex mixed-integer quadratic programs [PDF]
, 2011 Laurent and Poljak introduced a very general class of valid linear inequalities, called gap inequalities, for the max-cut problem. We show that an analogous class of inequalities can be defined for general non-convex mixed-integer quadratic programs ...
Galli, Laura +2 more
core +5 more sources
Mixed-Integer Programming to Solve Distribution Problems
Journal of New Results in Science, 2020 Mixed-integer linear and quadratic programming problems are considered to solve distribution problems in this paper. The first problem is the distribution of proctors with respect to the student placements to the class- rooms by mixed-integer linear ...
Kamil Oruçoğlu +4 more
doaj
Linear pencils and quadratic programming problems with a quadratic constraint
Linear Algebra and its Applications, 2023 24 pages. Comments are welcomed!
Gonzalez Zerbo, Santiago +2 more
openaire +3 more sources
ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
Journal of the Operations Research Society of Japan, 1976 Consider the nonlinear fractional programming problem max{f(x)lg(x)lxES}, where g(x»O for all XES. Jagannathan and Dinkelbach have shown that the maximum of this problem is equal to ~O if and only if max{f(x)-~g(x) IXES} is 0 for ~=~O. 1 t t Based on this result, we treat here a special case: f(x)=Zx Cx+r x+s, g(X)=~ xtDX+ptX+q and S is a polyhedron ...
IBARAKI, TOSHIHIDE +4 more
openaire +3 more sources
GPU acceleration of ADMM for large-scale quadratic programming [PDF]
J. Parallel Distributed Comput., 2019 The alternating direction method of multipliers (ADMM) is a powerful operator splitting technique for solving structured convex optimization problems.
M. Schubiger, G. Banjac, J. Lygeros
semanticscholar +1 more source
Fuzzy Information and Engineering, 2023 The aim of this paper is to propose an algorithm to solve and enhance a multi-level multi-objective integer quadratic programming problem (MLMOIQPP) under a single-valued Pentagonal Neutrosophic environment applied to the objective functions.
N. M. Bekhit +2 more
doaj +1 more source
A Global Optimization Algorithm for Generalized Quadratic Programming
Journal of Applied Mathematics, 2013 We present a global optimization algorithm for solving generalized quadratic programming (GQP), that is, nonconvex quadratic programming with nonconvex quadratic constraints.
Hongwei Jiao, Yongqiang Chen
doaj +1 more source
Neural-Dynamic Based Synchronous-Optimization Scheme of Dual Redundant Robot Manipulators
Frontiers in Neurorobotics, 2018 In order to track complex-path tasks in three dimensional space without joint-drifts, a neural-dynamic based synchronous-optimization (NDSO) scheme of dual redundant robot manipulators is proposed and developed. To do so, an acceleration-level repetitive
Zhijun Zhang, Qiongyi Zhou, Weisen Fan
doaj +1 more source