Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A simple proof of a general duality theorem of convex programming

From MaRDI portal
Publication:5592012
Jump to:navigation, search

DOI10.1007/BF01919548zbMATH Open0195.49501MaRDI QIDQ5592012FDOQ5592012

Balder von Hohenbalken

Publication date: 1969

Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)




zbMATH Keywords

operations research


Cites Work

  • Title not available (Why is that?)
  • A duality theorem for non-linear programming
  • A Duality Theorem for Convex Programs
  • A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
  • Dual Programs [Letter to the Editor]
  • A GENERAL DUALITY THEOREM OF CONVEX PROGRAMMING *


Cited In (1)

  • On the application of deterministic and stochastic programming methods to problems of economics;Mathematische Programmierung und ihre Anwendung auf die Wirtschaft






This page was built for publication: A simple proof of a general duality theorem of convex programming

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5592012&oldid=30232553"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 March 2024, at 03:51. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki