Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Reverse polyblock approximation for generalized multiplicative/fractional programming

From MaRDI portal
Publication:1762797
Jump to:navigation, search

zbMath1117.90322MaRDI QIDQ1762797

Nguyen Duc Nghia, Hoang Tuy

Publication date: 11 February 2005

Published in: Vietnam Journal of Mathematics (Search for Journal in Brave)


zbMATH Keywords

nonconvex global optimization problems


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)


Related Items (7)

Global optimization algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ An out space accelerating algorithm for generalized affine multiplicative programs problem ⋮ Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection




This page was built for publication: Reverse polyblock approximation for generalized multiplicative/fractional programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1762797&oldid=14111979"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki