Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multiple objective linear program is by one higher than the dimension of the projected polyhedron. The result implies that an arbitrary vector linear program (with arbitrary polyhedral ordering cone) can be solved by solving a multiple objective linear program (i.e. a vector linear program with the standard ordering cone) with one additional objective space dimension.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  • Benson H (1998) An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J Glob Optim 13:1–24

    Article  MathSciNet  MATH  Google Scholar 

  • Dauer JP (1987) Analysis of the objective space in multiple objective linear programming. J Math Anal Appl 126(2):579–593

    Article  MathSciNet  MATH  Google Scholar 

  • Dauer JP, Liu Y-H (1990) Solving multiple objective linear programs in objective space. Eur J Oper Res 46(3):350–357

    Article  MathSciNet  MATH  Google Scholar 

  • Ehrgott M, Löhne A, Shao L (2012) A dual variant of Benson’s outer approximation algorithm. J Glob Optim 52(4):757–778

    Article  MATH  Google Scholar 

  • Focke J (1973) Vektormaximumproblem und parametrische Optimierung. Math Operationsforsch Statist 4(5):365–369

    Article  MathSciNet  MATH  Google Scholar 

  • Fülöp J (1993) On the equivalence between a linear bilevel programming problem and linear optimization over the efficient set. Technical report, Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest. working paper 93-1

  • Grünbaum B (2003) Convex polytopes, volume 221 of graduate texts in mathematics. 2nd edition. Springer, New York, Prepared by V. Kaibel, V. Klee, and G.M. Ziegler

  • Heyde F, Löhne A (2011) Solution concepts in vector optimization: a fresh look at an old story. Optimization 60(12):1421–1440

    Article  MathSciNet  MATH  Google Scholar 

  • Jones CN, Kerrigan EC, Maciejowski JM (2008) On polyhedral projection and parametric programming. J Optim Theory Appl 138(2):207–220

    Article  MathSciNet  MATH  Google Scholar 

  • Löhne A (2011) Vector optimization with infimum and supremum. Vector optimization. Springer, Berlin

    Book  MATH  Google Scholar 

  • Löhne A, Rudloff B (2015) On the dual of the solvency cone. Discrete Appl Math 186:176–185

    Article  MathSciNet  MATH  Google Scholar 

  • Löhne A, Weißing B (2015) Bensolve-VLP solver, version 2.0.1. http://bensolve.org

  • Löhne A, Weißing B (2016) The vector linear program solver Bensolve–notes on theoretical background. Eur J Oper Res. doi:10.1016/j.ejor.2016.02.039

  • Lotov AV, Bushenkov VA, Kamenev GK (2004) Interactive decision maps, volume 89 applied optimization. Kluwer Academic Publishers, Boston, Approximation and visualization of Pareto frontier. With a foreword by Jared L, Cohon

  • Rockafellar R (1972) Convex analysis. Princeton University Press, Princeton

    MATH  Google Scholar 

  • Roux A, Zastawniak T (2015) Set optimization and applications —the state of the art: from set relations to set-valued risk measures, chapter linear vector optimization and European option pricing under proportional transaction costs. Springer, Berlin, pp 159–176

  • Sawaragi Y, Nakayama H, Tanino T (1985) Theory of multiobjective optimization, volume 176 mathematics in science and engineering. Academic Press, Orlando

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Friedrich Schiller University Jena, 07737, Jena, Germany

    Andreas Löhne & Benjamin Weißing

Authors
  1. Andreas Löhne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin Weißing
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Löhne.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Löhne, A., Weißing, B. Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming. Math Meth Oper Res 84, 411–426 (2016). https://doi.org/10.1007/s00186-016-0554-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-016-0554-0

Keywords

Mathematics Subject Classification

Search

Navigation