A class of infinite dimensional linear programming problems

DOI10.1016/0022-247X(82)90163-9zbMath0489.49003MaRDI QIDQ1166767

Nikolaos S. Papageorgiou

Publication date: 1982

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

continuous linear programmingRockafellar-Fenchel-duality

Mathematics Subject Classification ID

Linear programming (90C05) Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for problems in abstract spaces (49J27) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Duality and reflexivity in normed linear and Banach spaces (46B10) Optimality conditions for problems in abstract spaces (49K27)

Related Items (9)

Parametric continuous-time linear fractional programming problems ⋮ Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ Continuous-time linear programming problems revisited: A perturbation approach ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions ⋮ A duality theory of payment systems

Cites Work

• A class of continuous linear programming problems
• The multiplier method of Hestenes and Powell applied to convex programming
• A Duality Theorem for a Class of Continuous Linear Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of infinite dimensional linear programming problems