Advanced search
Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 65, 2016 - Issue 2
Submit an article Journal homepage
418
Views
15
CrossRef citations to date
0
Altmetric
Articles

Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes

Lizhen ShaoKey Laboratory of Advanced Control of Iron and Steel Process (Ministry of Education), School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing, China.;Department of Management Science, Lancaster University Management School, Lancaster, UK.Correspondence[email protected]
View further author information
&
Matthias EhrgottDepartment of Management Science, Lancaster University Management School, Lancaster, UK.View further author information
Pages 415-431 | Received 27 Oct 2014, Accepted 05 May 2015, Published online: 13 Jul 2015

References

  • Matsui T. NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 1996;9:113–119.
  • Benson H, Boger GM. Outcome-space cutting-plane algorithm for linear multiplicative programming. J. Optim. Theory Appl. 2000;104:301–322.
  • Kuno T. A finite branch-and-bound algorithm for linear multiplicative programming. Comput. Optim. Appl. 2001;20:119–135.
  • Gao Y, Xu C, Yang Y. An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 2006;179:494–505.
  • Ryoo HS, Sahindis NV. Global optimization of multiplicative programs. J. Global Optim. 2003;26:387–418.
  • Kim NTB, Trang NTL, Yen TTH. Outcome-space outer approximation algorithm for linear multiplicative programming. East West J. Math. 2007;9:81–98.
  • Depetrini D, Locatelli M. A FPTAS for a class of linear multiplicative problems. Comput. Optim. Appl. 2009;44:275–288.
  • Benson H, Boger GM. Multiplicative programming problems: analysis and efficient point search heuristic. J. Optim. Theory Appl. 1997;94:487–510.
  • Ehrgott M, Shao L, Schöbel A. An approximation algorithm for convex multi-objective programming problems. J. Global Optim. 2011;50:397–416.
  • Shao L, Ehrgott M. An objective space cut and bound algorithm for convex multiplicative programmes. J. Global Optim. 2014;58:711–728.
  • Ehrgott M, Löhne A, Shao L. A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming. J. Global Optim. 2012;52:757–778.
  • Benson H. An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. 1998;13:1–24.
  • Heyde F, Löhne A. Geometric duality in multi-objective linear programming. SIAM J. Optim. 2008;19:836–845.
  • Hamel AH, Löhne A, Rudloff B. Benson type algorithms for linear vector optimization and applications. J. Global Optim. 2014;59:811–836.
  • Löhne A. Vector optimization with infimum and supremum. Berlin: Springer; 2011.
  • Shao L, Ehrgott M. Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 2008;68:469–492.
  • Achterberg T. SCIP: Solving constraint integer programs. Math. Program. Comput. 2009;1:1–41.
  • Sahinidis NV. BARON 12.1.0: global optimization of mixed-integer nonlinear programs. User’s Manual. 2013.
  • Tawarmalani M, Sahinidis NV. A polyhedral branch-and-cut approach to global optimization. Math. Program. 2005;103:225–249.
  • Chen PC, Hansen P, Jaumard B. On-line and off-line vertex enumeration by adjacency lists. Oper. Res. Lett. 1991;10:403–409.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.