Results 11 to 20 of about 7,645,857 (241)
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +6 more sources
Reformulating mixed-integer quadratically constrained quadratic programs [PDF]
, 2011 It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a variety of optimisation problems. Moreover, in the particular case of mixed-integer quadratic programs, SDP has been used to reformulate problems, rather ...
Galli, L, Letchford, A. N.
core +4 more sources
Least Squares Method for Solving Fuzzy LR Interval Algebraic Linear Systems
Fuzzy Information and Engineering, 2022 We first investigate the solvability conditions of fuzzy LR interval algebraic linear systems with fuzzy LR interval coefficient matrix and fuzzy LR interval hand-right vector.
Mehrnoosh Salari +2 more
doaj +1 more source
A Solution Approach for Solving Fully Fuzzy Quadratic Programming Problems [PDF]
Journal of Applied Research on Industrial Engineering, 2018 Quadratic Programming has been widely applied to solve real-world problems. This paper describes a solution method for solving a special class of fuzzy quadratic programming problems with fuzziness in relations.
Nemat Allah Taghi-Nezhad +1 more
doaj +1 more source
The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases [PDF]
Discrete Applied Mathematics, 2012 We consider the bipartite unconstrained 0-1 quadratic programming problem (BQP01) which is a generalization of the well studied unconstrained 0-1 quadratic programming problem (QP01). BQP01 has numerous applications and the problem is known to be MAX SNP
Abraham P. Punnen +2 more
semanticscholar +1 more source
Mathematics, 2020 Zero-one quadratic programming is a classical combinatorial optimization problem that has many real-world applications. However, it is well known that zero-one quadratic programming is non-deterministic polynomial-hard (NP-hard) in general.
Shenshen Gu, Xinyi Chen
doaj +1 more source
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem
European Journal of Operational Research, 2016 We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP). Applications of the BBQP include mining discrete patterns from binary data, approximating matrices by
Daniel Karapetyan +2 more
semanticscholar +1 more source
An algorithm for piece-wise indefinite quadratic programming problem
Croatian Operational Research Review, 2020 An indefinite quadratic programming problem is a mathematical programming problem which is a product of two linear factors. In this paper, the piecewise indefinite quadratic programming problem (PIQPP) is considered.
Ritu Arora, Kavita Gupta
doaj +1 more source
Fuzzy Quadratic Programming with Non-negative Parameters: A Solving method based on Decomposition [PDF]
تصمیم گیری و تحقیق در عملیات, 2019 Quadratic programming problem is one of the important problem of classic optimization problems that the aim is to find the maximum or minimum amount of a quadratic function under linear constraints.
Nemat Allah Taghi-Nezhad +1 more
doaj +1 more source
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem [PDF]
INFORMS Journal on Computing, 2014 It is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in 𝒪(nc) time, where n is the number of items and c is the capacity of the knapsack. The quadratic knapsack problem, on the other hand, is NP-hard in the strong sense, which makes it unlikely that it can be solved in pseudo-polynomial time.
Franklin Djeumou Fomeni +1 more
openaire +2 more sources