An all-linear programming relaxation algorithm for optimizing over the efficient set
Year of publication: |
1991
|
---|---|
Authors: | Benson, Harold P. |
Published in: |
Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering. - Dordrecht [u.a.] : Springer, ISSN 0925-5001, ZDB-ID 1074566-X. - Vol. 1.1991, 1, p. 83-104
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Applying a mathematical programming approach for a green product mix decision
Tsai, Wen-hsien, (2012)
-
Optimal decision for warranty with consideration of marketing and production capacity
Yeh, Chun-wu, (2015)
-
Mathematical modelling of a robust inspection process plan : Taguchi and Monte Carlo methods
Mohammadi, Mehrdad, (2015)
- More ...
-
Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
Benson, Harold P., (2009)
-
Benson, Harold P., (2010)
-
A branch-and-bound algorithm for the concave cost supply problem
Yenipazarli, Arda, (2016)
- More ...