Structure of Efficient Sets for Strictly Quasi Convex Objectives

@inproceedings{Malivert1994StructureOE,
  title={Structure of Efficient Sets for Strictly Quasi Convex Objectives},
  author={C. Malivert and N. Boissard},
  year={1994}
}
  • C. Malivert, N. Boissard
  • Published 1994
This paper studies the weak efficient set (WEff P ) of a minimization problem P with k objectives defined on a convex set X of IRn. These objectives are continuous and belong to the class of so-called strictly quasiconvex functions, which contains, in particular, convex as well as linear fractional functions. When k is greater than n, it is of interest to replace the original problem by several subproblems, having at most n objectives. We show that if WEff P is bounded, the knowledge of the… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Ward : Structure of efficient sets for convex objectives

  • J.
  • Math . of Oper . Res .
  • 1989

On efficient solutions to multiple objective mathematical programs

  • T. J. Lowe, J.-F. Thisse, J. E. Ward, R. E. Wendell
  • Management Sci .
  • 1984

Wendell: On efficient solutions to multiple objective mathematical programs

  • T. J. Lowe, J.-F. Thisse, R.E.J.E. Ward
  • Management Sci
  • 1984
2 Excerpts

Schaible : Bibliography in fractional programming

  • S.
  • Zeitschrift für Operations Research
  • 1982

Contribution à l’étude des fonctions quasi-convexes

  • J. P. Crouzeix
  • Thèse de doctorat, U.E.R. des Sciences…
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…