On adaptive method for solving a Convex Quadratic Programming

Ikheneche, Nacera; Mohand Ouamer, Bibi

doi:10.46254/AN07.20170586

Back

7th Annual International Conference on Industrial Engineering and Operations Management

On adaptive method for solving a Convex Quadratic Programming

Download PDF

Nacera Ikheneche & Bibi Mohand Ouamer

Publisher: IEOM Society International

1 Views

1 Downloads

Track: Operations Research

In this work we present a variant of the support adaptive method of R. Gabasov and F.M.Kirillova for solving a convex quadratic programming with bounded variables, The concept of this later consists in intoducing the dual iteration during the change of the support, insteed to using the algebra rule, we use the concept of the simple step. Finally a numerical example is given for illustration purpose.

Published in: 7th Annual International Conference on Industrial Engineering and Operations Management, Rabat, Morocco

Publisher: IEOM Society International
Date of Conference: April 11 -13 , 2017

ISBN: 978-0-9855497-6-3
ISSN/E-ISSN: 2169-8767

Related Research

Critical Factors of Supplier Selection in the Food and Beverage Industry of Saudi Arabia A Fuzzy-TOPSIS Approach

11th Annual International Conference on Industrial Engineering and Operations Management

Published: 2021

Event of Crime against Property: Robbery & Theft Prediction using Probabilistic Graphical Model

10th Annual International Conference on Industrial Engineering and Operations Management

Published: 2020

Model for Locating Hospitals in a City

5th European International Conference on Industrial Engineering and Operations Management

Published: 2022