A Continuous Approach to Binary Quadratic Problems
نویسندگان
چکیده
منابع مشابه
A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملQuadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملA Semidefinite Optimization Approach to Quadratic Fractional Optimization with a Strictly Convex Quadratic Constraint
In this paper we consider a fractional optimization problem that minimizes the ratio of two quadratic functions subject to a strictly convex quadratic constraint. First using the extension of Charnes-Cooper transformation, an equivalent homogenized quadratic reformulation of the problem is given. Then we show that under certain assumptions, it can be solved to global optimality using semidefini...
متن کاملA New Approach to Continuous Riesz Bases
This paper deals with continuous frames and continuous Riesz bases. We introduce continuous Riesz bases and give some equivalent conditions for a continuous frame to be a continuous Riesz basis. It is certainly possible for a continuous frame to have only one dual. Such a continuous frame is called a Riesz-type frame [13]. We show that a continuous frame is Riesz-type if and only if it is a con...
متن کاملA Binary Quadratic Programming Approach to the Vehicle Positioning Problem
The Vehicle Positioning Problem (VPP) is a classical combinato-rial optimization problem that has a natural formulation as an integer quadratic program. This MIQCP is closely related to the Quadratic Assignment Problem and, as far as we know, has not received any attention yet. We show in this article that such a formulation has interesting theoretical properties. Its QP relaxation produces, in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics and Physics
سال: 2018
ISSN: 2327-4352,2327-4379
DOI: 10.4236/jamp.2018.68147