Quadratic Programming Problem

No Thumbnail Available

Date

2020-01-20

Journal Title

Journal ISSN

Volume Title

Publisher

Addis Ababa University

Abstract

Quadratic programming is one of the type of nonlinear optimization problems in which the objective function is quadratic and all the constraints are linear. There is no single method available for solving a quadratic programming problem. So a number of methods have been developed for solving quadratic programming problems. In this project concerns for convex and non convex quadratic programming problems with Lagrangian,Wolfe’s and Beale methods.

Description

Keywords

Quadratic, Programming, Problem

Citation

Collections