A GEOMETRIC PROGRAMMING APPROACH TO CONVEX MULTI-OBJECTIVE PROGRAMMING PROBLEMS
By
Rashmi Ranjan Ota and Sudipta Mishra
Department of Mathematics, ITER, SOA (Deemed to be University), Bhubaneswar, Odisha, India-751030
Email: rashmiranjanota@soa.ac.in, sudiptamishra00@gmail.com
(Received: January 11, 2023; In format January 19, 2023; Revised April 18, 2023; Accepted: April 21, 2023)
DOI: https://doi.org/10.58250/jnanabha.2023.53111
Abstract
Over the past few years, convex optimization has played a vital role in the study of complex engineering problems in different fields. Geometric programming is one of the available techniques particularly used for solving nonconvex programming problems. But in this article, a suitable attempt has been made to solve a real-life model on convex multi-objective using geometric programming technique with help of the E-constraint method and result is compared with the solutions obtained by fuzzy technique. Finally, a conclusion is presented by analyzing the
solutions to a numerical problem.
2020 Mathematical Sciences Classification: 90C25,90C29,90C30,90C70.
Keywords and Phrases: Convex optimization; Multi-objective optimization; Geometric programming; E-constraint method; Fuzzy.