Polyextremal principles and separably-infinite programs

DOI10.1007/BF01919901zbMath0451.90082MaRDI QIDQ3898336

A. Charnes, Paul R. Gribik, Kenneth O. Kortanek

Publication date: 1980

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

zbMATH Keywords

duality theorysemi-infinite programmingcomplementarity conditionsinfinite number of variablesinfinite number of constraintslinear programming characterizationexistence of saddle pointcharacterization conditionsseparably-infinite programspolyextremal principlessaddle value problemstwo-person zero-sum constrained gamesuniextremal dual separably- infinite programs

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05)

Cites Work

• Asymptotic cones and duality of linear relations
• Separably-infinite programs
• Numerical treatment of a class of semi‐infinite programming problems
• A duality theory for convex programs with convex constraints
• Convex Analysis
• Mathematical Programs with Optimization Problems in the Constraints
• Constrained Games and Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyextremal principles and separably-infinite programs