Please use this identifier to cite or link to this item:
http://nopr.niscpr.res.in/handle/123456789/67142Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Singh Chouhan, Ashok | - |
| dc.contributor.author | Mangal, Adarsh | - |
| dc.contributor.author | Shekhar, Gyan | - |
| dc.date.accessioned | 2026-01-15T11:26:54Z | - |
| dc.date.available | 2026-01-15T11:26:54Z | - |
| dc.date.issued | 2025-12 | - |
| dc.identifier.issn | 0975-2412 (Online) ; 0971-7706 (Print) | - |
| dc.identifier.uri | http://nopr.niscpr.res.in/handle/123456789/67142 | - |
| dc.description | 97-101 | en_US |
| dc.description.abstract | This research paper proposes an Approximation Algorithm to solve the Cubic Objective Function Programming Problem (COFPP). The same had been introduced to solve the Linear Programming Problem (LPP) by Khobragade et al. In this paper, we used the Approximation algorithm to solve linearly factorized cubic objective function programming problem. This algorithm can achieve an optimal solution in fewer iterations as compared to Simplex method. Hence, the proposed algorithm can be better understood by solving a cyclic problem | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | NIScPR-CSIR,India | en_US |
| dc.source | BVAAP Vol.33(2) [December 2025 ] | en_US |
| dc.subject | Algorithm | en_US |
| dc.subject | cubic | en_US |
| dc.subject | objective | en_US |
| dc.subject | programming problem | en_US |
| dc.title | Optimization through Approximation Algorithm | en_US |
| dc.identifier.doi | https://doi.org/10.56042/bvaap.v33i2.19339 | en_US |
| Appears in Collections: | BVAAP Vol.33(2) [ December 2025] | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BVAAP vol-33(2) 97-101.pdf | 813.03 kB | Adobe PDF | View/Open |
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.