Compromising solution of geometric programming problem with bounded parameters

DOI10.1007/s40305-016-0145-zzbMath1387.90104OpenAlexW2568686051MaRDI QIDQ1697901

Geetanjali Panda, Mrinal Jana

Publication date: 20 February 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0145-z

zbMATH Keywords

decision makingnonlinear programminggeometric programmingpartial orderinginterval-valued function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Management decision making, including multiple objectives (90B50) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

An optimized approach of venous thrombus embolism risk assessment

Cites Work

• Unnamed Item
• Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients
• Optimal value bounds in nonlinear programming with interval data
• An interactive method of tackling uncertainty in interval multiple objective linear programming
• Multiple objective linear programming models with interval coefficients -- an illustrated overview
• Optimal value range in interval linear programming
• Calculus for interval functions of a real variable
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• Complexity of necessary efficiency in interval linear programming and multiobjective linear programming
• Posynomial parametric geometric programming with interval valued coefficient
• Efficient solution of interval optimization problem
• Posynomial geometric programming with interval exponents and coefficients
• A nonlinear interval number programming method for uncertain optimization problems
• On interval-valued nonlinear programming problems
• Posynomial geometric programming with parametric uncertainty
• Introduction to Interval Analysis
• An Interval Arithmetic Approach to Sensitivity Analysis in Geometric Programming
• An Interactive Method To Multiobjective Linear Programming Problems With Interval Coefficients

This page was built for publication: Compromising solution of geometric programming problem with bounded parameters