Parametric simplex algorithms for solving a special class of nonconvex minimization problems
Year of publication: |
1991
|
---|---|
Authors: | Konno, Hiroshi |
Other Persons: | Yajima, Yasutoshi (contributor) ; Matsui, Tomomi (contributor) |
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. 65-81
|
Subject: | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Ivanov, Dmitry, (2015)
-
An improved ant algorithm for multi-mode resource constrained project scheduling problem
Wuliang, Peng, (2014)
-
Computing booking limits under a non-parametric demand model : a mathematical programming approach
Hosseinalifam, Morad, (2016)
- More ...
-
Convex programs with an additional constraint on the product of several convex functions
Kuno, Takahito, (1994)
-
Global minimization of a generalized convex multiplicative function
Konno, Hiroshi, (1994)
-
Efficient algorithms for solving rank two and rank three bilinear programming problems
Yajima, Yasutoshi, (1991)
- More ...