Optimality Conditions for Fuzzy Number Quadratic Programming with Fuzzy Coefficients
Journal of Applied Mathematics, 2014 The purpose of the present paper is to investigate optimality conditions and duality theory in fuzzy number quadratic programming (FNQP) in which the objective function is fuzzy quadratic function with fuzzy number coefficients and the constraint set is ...
Xue-Gang Zhou +2 more
doaj +1 more source
Extension of Wolfe Method for Solving Quadratic Programming with Interval Coefficients
Journal of Applied Mathematics, 2017 Quadratic programming with interval coefficients developed to overcome cases in classic quadratic programming where the coefficient value is unknown and must be estimated. This paper discusses the extension of Wolfe method.
Syaripuddin, Herry Suprajitno, Fatmawati
doaj +1 more source
A novel computational method for neutrosophic uncertainty related quadratic fractional programming problems [PDF]
Neutrosophic Sets and Systems, 2023 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
A new method for solving quadratic fractional programming problem in neutrosophic environment
Open Engineering, 2021 In the current study, a neutrosophic quadratic fractional programming (NQFP) problem is investigated using a new method. The NQFP problem is converted into the corresponding quadratic fractional programming (QFP) problem.
Khalifa Hamiden Abd El-Wahed +2 more
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 +8 more
core +1 more source
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Journal of Applied Mathematics, 2013 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
An Algebraic-Based Primal–Dual Interior-Point Algorithm for Rotated Quadratic Cone Optimization
Computation, 2023 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 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
Degree reduction of Rational Bézier curves by hybrid optimization method
Results in Applied Mathematics, 2022 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]
Archives of Control Sciences, 2020 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