An algorithm for piece-wise indefinite quadratic programming problem
From MaRDI portal
Publication:5147642
DOI10.17535/crorr.2020.0004zbMath1458.90502OpenAlexW3042540198MaRDI QIDQ5147642
Publication date: 27 January 2021
Published in: Croatian Operational Research Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17535/crorr.2020.0004
optimal solutionindefinite quadratic programming problemquasi-concave functionpiecewise indefinite quadratic function
Cites Work
- Unnamed Item
- A simplex algorithm for piecewise-linear fractional programming problems
- On a class of quadratic programs
- Global minimization of indefinite quadratic problems
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Models for representing piecewise linear cost functions
- A modified goal programming model for piecewise linear functions
- A nonconvex, piecewise linear optimization problem
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Maximizing the sum of certain quasiconcave functions using generalized benders decomposition
- The Indefinite Quadratic Programming Problem
- A Note on Appointment Scheduling with Piecewise Linear Cost Functions
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
This page was built for publication: An algorithm for piece-wise indefinite quadratic programming problem