Classifying convex extremum problems over linear topologies having separation properties
type: Item
instance of: scholarly article
title: Classifying convex extremum problems over linear topologies having separation properties
zbMATH Open document ID: 0283.90043
DOI: 10.1016/0022-247X(74)90270-4
author: Yanyan Li
published in: Journal of Mathematical Analysis and Applications
publication date: 1974-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 3445030
MaRDI profile type: Publication
cites work: Q5588015
cites work: Erratum: Asymptotic duality over closed convex sets
cites work: Asymptotic duality over closed convex sets
cites work: Q3227025
cites work: Q5730367
cites work: Q3236244
cites work: Convex analysis treated by linear programming
cites work: Asymptotic cones and duality of linear relations
cites work: Q5821624
cites work: On a classification scheme for geometric programming and complementarity theorems††
cites work: Nonconvex Linear Topologies with the Hahn Banach Extension Property
cites work: Non-Chebyshevian Moment Problems
cites work: Linear Programming in Reflexive Spaces
cites work: Q5684826
cites work: Classification Schemes for the Strong Duality of Linear Programming Over Cones
cites work: Solution Sets of Convex Programs Related to Chemical Equilibrium Problems
cites work: On Refinements of Some Duality Theorems in Linear Programming over Cones
cites work: Programmes in Paired Spaces
cites work: Q5581077
cites work: Symmetric Duality for Generalized Unconstrained Geometric Programming
cites work: Duality and stability in extremum problems involving convex functions
cites work: Q5599348
cites work: Linear programs in topological vector spaces
cites work: Q5603731
cites work: A note on duality gaps in linear programming over convex sets
description: scientific article; zbMATH DE number 3445030