A New Heuristic for the Convex Quadratic Programming Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Solving Interval Quadratic Programming Problem

This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...

متن کامل

A new bound for the quadratic assignment problem based on convex quadratic programming

We describe a new convex quadratic programming bound for the quadratic assignment problem (QAP). The construction of the bound uses a semideenite programming representation of a basic eigenvalue bound for QAP. The new bound dominates the well-known projected eigenvalue bound, and appears to be competitive with existing bounds in the tradeoo between bound quality and computational eeort.

متن کامل

A Dynamic Programming Heuristic for the Quadratic Knapsack Problem

It is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in O(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. We show however that the dynamic programming appro...

متن کامل

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 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Operations Research

سال: 2015

ISSN: 2160-8830,2160-8849

DOI: 10.4236/ajor.2015.55031