On the nonlinear multilevel programming problems
From MaRDI portal
Publication:998684
DOI10.1007/BF03398760zbMath1153.90518OpenAlexW2778650438MaRDI QIDQ998684
Publication date: 9 February 2009
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398760
fractional programmingquasiconcave functionmultilevel programmingindefinite quadratic programming problem
Cites Work
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
- Linear multiplicative programming
- Quasi-concave minimization subject to linear constraints
- On the quasiconcave bilevel programming problem
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- Convergent Algorithms for Minimizing a Concave Function
- Global Maximization of a Convex Function with Linear Inequality Constraints
- Maximization of A convex quadratic function under linear constraints
- An Algorithm for Separable Nonconvex Programming Problems
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
- Solving the Fixed Charge Problem by Ranking the Extreme Points
This page was built for publication: On the nonlinear multilevel programming problems