A novel computational method for neutrosophic uncertainty related quadratic fractional programming problems [PDF]
This study introduces a novel method for addressing the pentagonal quadratic fractional programming problem (PQFPP). We employ pentagonal neutrosophic numbers for the objective function's cost, resources, and technological coefficients.
S.A. Edalatpanah +3 more
doaj +1 more source
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
In rotated quadratic cone programming problems, we minimize a linear objective function over the intersection of an affine linear manifold with the Cartesian product of rotated quadratic cones.
Karima Tamsaouete, Baha Alzalg
doaj +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
Dynamic economic dispatch using complementary quadratic programming
Economic dispatch for micro-grids and district energy systems presents a highly constrained non-linear, mixed-integer optimization problem that scales exponentially with the number of systems.
D. McLarty +3 more
semanticscholar +1 more source
A Global Optimization Algorithm for Generalized Quadratic Programming
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
Degree reduction of Rational Bézier curves by hybrid optimization method
The paper addresses the problem of degree reduction of rational Bézier curves. A new optimization problem is formulated based on the weighted sum method, weighted least squares and quadratic programming.
Mao Shi
doaj +1 more source
Fuzzy goal programming technique for multi-objective indefinite quadratic bilevel programming problem [PDF]
Bilevel programming problem is a non-convex two stage decision making process in which the constraint region of upper level is determined by the lower level problem.
Ritu, Arora, Kavita, Gupta
doaj +1 more source
Efficient method to compute search directions of infeasible primal-dual path-following interior-point method for large scale block diagonal quadratic programming [PDF]
Quadratic programming is an important optimization problem that has applications in many areas such as finance, control, and management. Quadratic programs arisen in practice are often large but sparse, and they usually cannot be solved efficiently ...
Duangpen Jetpipattanapong +1 more
doaj +1 more source
A Simple SQP Algorithm for Constrained Finite Minimax Problems
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming.
Lirong Wang, Zhijun Luo
doaj +1 more source
The quadratic programming problem has broad applications in mobile robot path planning. This article presents an efficient optimization algorithm for globally solving the quadratic programming problem.
Lei Cai, Juanjuan Yang, Li Zhao, Lan Wu
doaj +1 more source

