Indefinite cubic programming with standard errors in objective function

DOI10.1007/BF01918319zbMATH Open0159.48601OpenAlexW2005428045MaRDI QIDQ5545150FDOQ5545150

Authors: C. R. Bector 

Publication date: 1968

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

Full work available at URL: https://doi.org/10.1007/bf01918319

zbMATH Keywords

operations research

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Programming with linear fractional functionals
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
• The Cutting-Plane Method for Solving Convex Programs
• Quasi-Concave Programming
• Title not available (Why is that?)
• Pseudo-Convex Functions
• Title not available (Why is that?)

Cited In (2)

• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• Rank restrictions on the quadratic form in indefinite quadratic programming

This page was built for publication: Indefinite cubic programming with standard errors in objective function

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