O'Reilly logo

Applied Mathematical Methods by Bhaskar Dasgupta

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

25

Linear and Quadratic Programming Problems*

In this chapter, we are going to study a few common examples of convex programming problems. The reader is expected to have a fair background of linear programming already. As such, we discuss the main features of the linear programming problem mostly in the spirit of recapitulation. Next, we develop the ideas and methods of the quadratic programming problem. Finally, as its application, we work out a trust region method for function minimization, which has been left in the background for quite a few intervening chapters.

Linear Programming

In an optimization problem, if the objective function as well as all the constraint functions are linear, then we call it a linear optimization or linear programming ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required