An algorithm for piece-wise indefinite quadratic programming problem
From MaRDI portal
Publication:5147642
DOI10.17535/CRORR.2020.0004zbMATH Open1458.90502OpenAlexW3042540198MaRDI QIDQ5147642FDOQ5147642
Authors: Ritu Arora, Kavita Gupta 
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
Recommendations
- scientific article; zbMATH DE number 778347
- Indefinite quadratic integer bilevel programming problem with bounded variables
- scientific article; zbMATH DE number 484155
- On the indefinite quadratic bilevel programming problem.
- A cutting plane approach for multi-objective integer indefinite quadratic programming problem
indefinite quadratic programming problemoptimal solutionquasi-concave functionpiecewise indefinite quadratic function
Cites Work
- Title not available (Why is that?)
- Global minimization of indefinite quadratic problems
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Models for representing piecewise linear cost functions
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty
- On a class of quadratic programs
- A nonconvex, piecewise linear optimization problem
- The Indefinite Quadratic Programming Problem
- A modified goal programming model for piecewise linear functions
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- A simplex algorithm for piecewise-linear fractional programming problems
- A note on appointment scheduling with piecewise linear cost functions
- Maximizing the sum of certain quasiconcave functions using generalized benders decomposition
Cited In (1)
This page was built for publication: An algorithm for piece-wise indefinite quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147642)
