Complexity of necessary efficiency in interval linear programming and multiobjective linear programming

  title={Complexity of necessary efficiency in interval linear programming and multiobjective linear programming},
  author={Milan Hlad{\'i}k},
  journal={Optimization Letters},
  • M. Hladík
  • Published 1 June 2012
  • Mathematics
  • Optimization Letters
We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x* is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the case of only one objective. Provided that x* is a non-degenerate basic solution, the problem is… 

On Relation of Possibly Efficiency and Robust Counterparts in Interval Multiobjective Linear Programming

We investigate multiobjective linear programming with uncertain cost coefficients. We assume that lower and upper bounds for uncertain values are known, no other assumption on uncertain costs is

How to determine basis stability in interval linear programming

This paper proposes a method for testing basis stability and even though the method is exponential in the worst case (not surprisingly due to NP-hardness of the problem), it is fast in many cases.

On the Properties of Interval Linear Programs with a Fixed Coefficient Matrix

Interval programming is a modern tool for dealing with uncertainty in practical optimization problems. In this paper, we consider a special class of interval linear programs with interval

On strong optimality of interval linear programming

  • M. Hladík
  • Mathematics, Computer Science
    Optim. Lett.
  • 2017
A related optimality concept of semi-strong optimality is investigated, showing its characterization and complexity in a linear programming problem with interval data.

Obtaining Efficient Solutions of Interval Multi-objective Linear Programming Problems

The proposed method solves the IMOLP model corresponding to the problem of the facilities and non-return funds in a bank and generalizes the $$\varepsilon$$ ε -constraint and lexicographic methods which are used for obtaining ESs of the multi-objective linear programming (MOLP) models which are applicable for large-scale problems.

Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem

This paper attempts to propose a new model with interesting properties by considering the minimax regret criterion and suggests an algorithm to obtain an optimal solution of the new model.

Robust optimal solutions in interval linear programming with forall-exists quantifiers

  • M. Hladík
  • Mathematics, Computer Science
    Eur. J. Oper. Res.
  • 2016



On necessarily efficient solutions in interval multiobjective linear programming

We investigate multiobjective linear programming problems with objective coefficients varying inside given intervals. A feasible solution x ∗ is called necessarily efficient if it is efficient for

Computing the tolerances in multiobjective linear programming

A procedure computing a tolerance for each objective function coefficient, such that all these coefficients may simultaneously and independently vary within their tolerances while preserving the efficiency of x*.

Linear Multiple Objective Problems with Interval Coefficients

In this paper we consider linear multiple objective programs with coefficients of the criteria given by intervals. This class of problems is of practical interest since in many instances it is

Strong Unboundedness of Interval Linear Programming Problems

  • J. Koničková
  • Mathematics
    12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)
  • 2006
A linear programming problem whose coefficients are prescribed by intervals is called strongly unbounded if each linear programming problem obtained by fixing coefficients in these intervals is

An interactive method of tackling uncertainty in interval multiple objective linear programming

The presented procedures provide a global view of the solutions in the best and worst case coefficient scenarios and allow performing the search for new solutions according to the achievement rates of the objective functions regarding both the upper and lower bounds.

A survey of recent developments in multiobjective optimization

Recent developments in Multiobjective Optimization are discussed, including optimality conditions, applications, global optimization techniques, the new concept of epsilon Pareto optimal solution, and heuristics.

Solutions for the Portfolio Selection Problem with Interval and Fuzzy Coefficients

  • M. Ida
  • Mathematics
    Reliab. Comput.
  • 2004
Investigating the properties of two efficiency conditions by means of preference cones and feasible region, it is discussed that the two kinds of solutions can be identified with the sets of combinations of lower or upper bounds of intervals.

Linear Optimization Problems with Inexact Data

Theorem A: solvability of systems of interval linear equations and inequalities and optimization problems over max-algebras.

Portfolio selection problem with interval coefficients

  • M. Ida
  • Mathematics, Economics
    Appl. Math. Lett.
  • 2003