Multi-Objective Nonlinear Sum of Fractional Optimization Problems with Non-Convex Constraints Using Duality Based Branch and Bound Algorithm
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | D. Bhati, P. Singh |
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Series: | Ukrainian Mathematical Journal |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000791138 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
A dynamic branching based on nonlinear estimations in the branch and bound method
by: V. V. Boiko, et al.
Published: (2019) -
Algorithm Solving the Problem of Optimal Function by Method of Branch and Bound
by: M. V. Leonova
Published: (2013) -
On Shor's r-Algorithm for Problems with Constraints
by: V. Norkin, et al.
Published: (2023) -
The lower bound for the volume of a three-dimensional convex polytope
by: Kawaguchi, Ryo
Published: (2016) -
The lower bound for the volume of a three-dimensional convex polytope
by: R. Kawaguchi
Published: (2015)