Puchit Sariddichainunta

  • Citations Per Year
Learn More
* Department of Mathematics and Computer Science, Chulalongkorn University. Abstract The winner determination problem (WDP) for a single object auction is a relatively easy problem to solve using the greedy algorithm. However, a booth auction is one of the nonidentical multiple-object auctions which is NP-hard problem. Formulation of the winner(More)
Bilevel linear programming (BLP) is a solution method for linear optimization problem with two sequential decision steps of the leader and the follower. In this paper, we assume that the follower's objective function is imprecise and can be represented by a fuzzy function, the BLP with the follower's fuzzy objective function (BLPwFFO). We apply the approach(More)
  • 1