Item selection using Multiobjective Programming
Door: Gardeman, A.J.R.M. | 01-01-1987 In this thesis two methods are described to solve the item selection problem when several criteria are involved. These criteria are represented by a composite objective function that has to be minimized or maximized over the feasible region.The first method can be applied if the composite objective function is linear. A tractable implementation of this method is presented as well as some simulation results.
The second method can be applied if we are dealing with a quadratic composite objective function. A tractable implementation of this method is still in progress. Some simulation results for this method
are presented. However, there are still some theoretical problems that
have to be managed.
Some advices for users of these methods as well as some recommendations for a supplementary study can be found in this thesis.
Read more
Kunnen we je helpen?
Stel je vraag via onze kanalen of kijk in de veelgestelde vragen.
Voor scholen: Vergeet niet om het brinnummer bij de hand te hebben en/of in de mail te vermelden, zodat we jouw vraag sneller kunnen behandelen!