On solving complex programs

MaRDI QIDQ2265951zbMATH OpenFDO

Authors G. J. Murray, Bertram Mond

Publication date 1984

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

dual complex linear programming problemsreduction algorithm

Mathematics Subject Classification ID

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

Review text

The paper mainly contains a procedure for reducing a pair of dual complex linear programming problems [see \textit{N. Lewinson}, J. Math. Anal. Appl. 14, 44-62 (1966; Zbl 0136.138)] into a pair of dual real linear problems.

Recommendations

• scientific article; zbMATH DE number 4068621
• scientific article; zbMATH DE number 3941274
• scientific article; zbMATH DE number 3877862
• Existence theory for the complex linear complementarity problem
• scientific article; zbMATH DE number 3856832

Cited in

(4)

• Programs with restoration of computations
• Extension to necessary optimality conditions in complex programming
• On some decision problems in programming
• Complex nonlinear programming: Duality with invexity and equivalent real programs

This page was built for publication: On solving complex programs

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