On Equivalence Between a Saddle-Point Problem and Linear Programming in Complex Space

DOI10.1002/zamm.19790590212zbMath0412.90067OpenAlexW2041732750MaRDI QIDQ4199851

R. N. Kaul, Neelam Datta

Publication date: 1979

Published in: ZAMM - Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19790590212

zbMATH Keywords

dualitysaddle-point problemlinear programming in complex space

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On Equivalence Between a Saddle-Point Problem and Linear Programming in Complex Space