An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem

DOI10.1051/ro/2023152OpenAlexW4386931114MaRDI QIDQ6181252

Debjani Chakraborty, Vishnu Singh, Unnamed Author, Kirti Sharma, Ali Ebrahimnejad

Publication date: 22 January 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2023152

zbMATH Keywords

ranking functioninvestment problemintuitionistic fuzzy line segmentnon-linear separable programming problem

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Arithmetic operations on generalized intuitionistic fuzzy number and its applications to transportation problem
• Sensitivity analysis in fuzzy number linear programming problems
• A theoretical development of distance measure for intuitionistic fuzzy numbers
• An effective linear approximation method for separable programming problems
• A procedure for ordering fuzzy subsets of the unit interval
• Models for representing piecewise linear cost functions
• Relaxations and heuristics for the multiple non-linear separable knapsack problem
• Intuitionistic fuzzy sets. Theory and applications
• A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming
• Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
• An inexact accelerated stochastic ADMM for separable convex optimization
• An efficient algorithm for finding all solutions of nonlinear equations using parallelogram LP test
• A fuzzy logic algorithm for optimizing the investment decisions within companies
• A new approach for ranking of intuitionistic fuzzy numbers using a centroid concept
• Linearly constrained global optimization via piecewise-linear approximation
• Non-Linear Programming—A Survey
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• Linear programming with Triangular Intuitionistic Fuzzy Number
• AN OPTIMAL CONSUMPTION AND INVESTMENT PROBLEM WITH QUADRATIC UTILITY AND SUBSISTENCE CONSUMPTION CONSTRAINTS: A DYNAMIC PROGRAMMING APPROACH
• Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability
• Explicit model of dual programming and solving method for a class of separable convex programming problems
• Programming with linear fractional functionals
• An algorithm for approximating convex functions by means by first degree splines
• Separable programming. Theory and methods

This page was built for publication: An optimization method to solve a fully intuitionistic fuzzy non-linear separable programming problem