Semi-infinite transportation problems

DOI10.1016/0022-247X(82)90214-1zbMath0491.90064MaRDI QIDQ5905183

Maretsugu Yamasaki, Kenneth O. Kortanek

Publication date: 1982

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

zbMATH Keywords

optimality conditionsfinite- dimensional dual unconstrained concave programgeneral pairings of linear spacesgeneralized column number conditionsinfinite number of destination requirementsprimal semi-infinite programsemi-infinite transportation dual-program pair

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Semi-infinite programming (90C34)

Related Items

On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints, Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions, An algorithm for semi-infinite transportation problems, Partially finite convex programming. I: Quasi relative interiors and duality theory, Partially finite convex programming. II: Explicit lattice models, Duality gap function in infinite dimensional linear programming, Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints, On the core of semi-infinite transportation games with divisible goods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for duality theorems in infinite linear programming problems
• Asymptotic cones and duality of linear relations
• Programmes in Paired Spaces
• Equalities in transportation problems and characterizations of optimal solutions
• Note—Solving the Generalized Market Area Problem
• The Generalized Market Area Problem
• Dual existence theorems for a special class of linear programming problems in reflexive Banach lattices
• A Partitioning Problem with Applications in Regional Design