Minimization of a concave function on a convex polyhedron

• Autorzy: Stanisław L. Kryński
• Języki publikacji: EN

Abstrakty

EN

The problem of minimizing a concave function on a convex polyhedron is considered. The author proposes a solution algorithm which, starting from a vertex representing a local minimum of the objective function, constructs a sequence of auxiliary linear programming problems in order to find a global minimum. The convergence of the algorithm is proven.

PL

.

Słowa kluczowe

EN

Convex programming; Nonlinear programming

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1982
• Tom: 10
• Numer: 21

Daty

wydano

1982

online

1982-12-01

Twórcy

autor

Stanisław L. Kryński

Identyfikatory

DOI

10.14708/ma.v10i21.1617