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

DOI10.1002/ZAMM.19790590212zbMATH Open0412.90067OpenAlexW2041732750MaRDI QIDQ4199851FDOQ4199851

Authors: 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

• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199851)