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

Duality theorems for a class of nonconvex programming problems

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

DOI10.1007/BF00935199zbMATH Open0241.90054MaRDI QIDQ2553909FDOQ2553909


Authors: O. Rani, R. N. Kaul Edit this on Wikidata


Publication date: 1973

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)






Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)


Cites Work

  • Title not available (Why is that?)
  • Duality in quadratic programming
  • Finding all vertices of a convex polyhedron
  • Duality in fractional programming
  • Duality in nonlinear programming


Cited In (1)

  • Conjugate duality for fractional programs





This page was built for publication: Duality theorems for a class of nonconvex programming problems

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

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