Optimal solution set in interval quadratic programming problem

Authors

  • Mahdieh Ghorbani Hormazdabadi Kerman Branch, Islamic Azad University
  • Hassan Mishmast Nehi University of Sistan and Baluchestan
  • Mehdi Allahdadi University of Sistan and Baluchestan

DOI:

https://doi.org/10.30495/jme.v14i0.1098

Abstract

There are several methods to compute the optimal bounds of the objective function for interval quadratic programming (IQP) problems, but no method has yet been suggested to calculate a set of optimal solutions of IQP problems. This paper presents an accurate set of optimal solutions for the interval quadratic programming problems. The optimal solution of the quadratic programming problem is not essentially an extreme point. We rst propose conditions that make the optimal solutions of the IQP to extreme points and then, using these conditions, we compute the exact set of optimal solutions for the IQP problem.

Downloads

Published

2019-04-10

Issue

Section

Vol. 14, No. 2, (2020)