Lineare Optimierung in unendlichdimensionalen Vektorräumen

DOI10.1007/BF02234110zbMath0243.90020OpenAlexW410562454MaRDI QIDQ2554649

Frank Lempio

Publication date: 1971

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02234110

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Related Items (4)

A Calculation of all Separating Hyperplanes of two Convex Polytopes ⋮ On a calculation of an arbitrary separating hyperplane of convex polyhedral sets ⋮ Ein linearen Mehrentscheidungsmodell ⋮ Lineare Optimierung in unendlichdimensionalen Vektorräumen

Cites Work

• A class of continuous linear programming problems
• A duality theory for abstract mathematical programs with applications to optimal control theory
• Lineare Optimierung in unendlichdimensionalen Vektorräumen
• Lineare Optimierung in halbgeordneten Vektorräumen
• Separation Properties of Convex Cones
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lineare Optimierung in unendlichdimensionalen Vektorräumen