Indefinite cubic programming with standard errors in objective function

DOI10.1007/BF01918319MaRDI QIDQ5545150zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3227649 (Why is no real title available?)
• Programming with linear fractional functionals
• Pseudo-Convex Functions
• Quasi-Concave Programming
• The Cutting-Plane Method for Solving Convex Programs
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints

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)