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

scientific article; zbMATH DE number 3891108

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

zbMATH Open0558.90076MaRDI QIDQ3347643FDOQ3347643


Authors: Stane Indihar Edit this on Wikidata


Publication date: 1985



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 4104722
  • Global maximization of special classes of convex functions on a convex polyhedral set
  • scientific article; zbMATH DE number 4108510
  • Publication:3030587
  • A note on the solution of bilinear programming problems by reduction to concave minimization


zbMATH Keywords

convex functionbilinear programmingbounded polyhedron


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Sensitivity, stability, parametric optimization (90C31)



Cited In (5)

  • Title not available (Why is that?)
  • Optimality conditions for maximizing a function over a polyhedron
  • Title not available (Why is that?)
  • Finding the Maximum Subset with Bounded Convex Curvature
  • On the pointwise maximum of convex functions





This page was built for publication:

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

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