An achievement rate approach to linear programming problems with an interval objective function

DOI10.1057/palgrave.jors.2600322zbMath0881.90095OpenAlexW2064855087MaRDI QIDQ4345513

Masatoshi Sakawa, Masahiro Inuiguchi

Publication date: 19 February 1998

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

Full work available at URL: http://pure.iiasa.ac.at/id/eprint/4176/1/WP-94-033.pdf

zbMATH Keywords

simplex methodinterval objective functionmaximin achievement rate solution

Mathematics Subject Classification ID

Fractional programming (90C32) Linear programming (90C05)

Related Items (13)

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems ⋮ Generation of some methods for solving interval multi-objective linear programming models ⋮ Robust Optimization by Fuzzy Linear Programming ⋮ Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients ⋮ Possibilistic linear programming: A brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem ⋮ New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach ⋮ Finding efficient solutions in the interval multi-objective linear programming models ⋮ Robust optimization under softness in a fuzzy linear programming problem ⋮ A New Interval Multi-Objective Optimization Method for Uncertain Problems with Dependent Interval Variables ⋮ Portfolio selection under independent possibilistic information ⋮ A sixth bibliography of fractional programming ⋮ Relatively robust decisions ⋮ An Extended Necessity Measure Maximisation Incorporating the Trade-Off between Robustness and Satisfaction in Fuzzy LP Problems

This page was built for publication: An achievement rate approach to linear programming problems with an interval objective function