Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming

Published 2012 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming
Authors
Keywords
-
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 221, Issue 1, Pages 165-174
Publisher
Elsevier BV
Online
2012-03-13
DOI
10.1016/j.ejor.2012.02.035

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.