Dualitätstheorie für hyperboiisehe und stückweise lineare konvexe optimierungsprobleme

Abstract
Using a generalized LANGRANGE function for a linear hyperbelie programming problem the author of the present paper construets a dual problem, which becomes a piecewise linear convex programming problem. For such dual problems, propositions on duality are proved containing in particular all propostions of the duality theory of linear programming.

This publication has 6 references indexed in Scilit: