Abstract

The paper is devoted to the construction of an algorithm for solving an optimization logistic problem with a quadratic objective function. This problem is a quadratic programming problem with constraints such as equalities and inequalities. One of the constraints contains a parameter. The solution of the problem needs to be obtained in general form for any parameter value. In the process of constructing the algorithm, the concept of corner points is introduced. The solution of the problem is reduced to finding a finite set of corner points. All other optimal solutions are represented as linear combinations of two corner points. The constructed algorithm is implemented on a test example.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call