Solving bilevel quadratic programming problems and its application

Shamshul Bahar Yaakob, Junzo Watada

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages187-196
Number of pages10
Volume6883 LNAI
EditionPART 3
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011 - Kaiserslautern
Duration: 2011 Sep 122011 Sep 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume6883 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011
CityKaiserslautern
Period11/9/1211/9/14

Fingerprint

Bilevel Programming
Quadratic programming
Quadratic Programming
Branch and bound method
Supply chain management
Programming
Logistics
Marketing
Distribution Center
Logistics/distribution
Branch and Bound Method
Supply Chain Management
Computing

Keywords

  • bilevel programming problems
  • ergodic branch-and-bound
  • logistics distribution centers
  • mixed integer programming problems

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yaakob, S. B., & Watada, J. (2011). Solving bilevel quadratic programming problems and its application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 3 ed., Vol. 6883 LNAI, pp. 187-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6883 LNAI, No. PART 3). https://doi.org/10.1007/978-3-642-23854-3_20

Solving bilevel quadratic programming problems and its application. / Yaakob, Shamshul Bahar; Watada, Junzo.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6883 LNAI PART 3. ed. 2011. p. 187-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6883 LNAI, No. PART 3).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yaakob, SB & Watada, J 2011, Solving bilevel quadratic programming problems and its application. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 edn, vol. 6883 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 6883 LNAI, pp. 187-196, 15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011, Kaiserslautern, 11/9/12. https://doi.org/10.1007/978-3-642-23854-3_20
Yaakob SB, Watada J. Solving bilevel quadratic programming problems and its application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 3 ed. Vol. 6883 LNAI. 2011. p. 187-196. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). https://doi.org/10.1007/978-3-642-23854-3_20
Yaakob, Shamshul Bahar ; Watada, Junzo. / Solving bilevel quadratic programming problems and its application. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6883 LNAI PART 3. ed. 2011. pp. 187-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).
@inproceedings{97a0f4304ce344e4ab790979739fae6c,
title = "Solving bilevel quadratic programming problems and its application",
abstract = "Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.",
keywords = "bilevel programming problems, ergodic branch-and-bound, logistics distribution centers, mixed integer programming problems",
author = "Yaakob, {Shamshul Bahar} and Junzo Watada",
year = "2011",
doi = "10.1007/978-3-642-23854-3_20",
language = "English",
isbn = "9783642238536",
volume = "6883 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 3",
pages = "187--196",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 3",

}

TY - GEN

T1 - Solving bilevel quadratic programming problems and its application

AU - Yaakob, Shamshul Bahar

AU - Watada, Junzo

PY - 2011

Y1 - 2011

N2 - Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.

AB - Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.

KW - bilevel programming problems

KW - ergodic branch-and-bound

KW - logistics distribution centers

KW - mixed integer programming problems

UR - http://www.scopus.com/inward/record.url?scp=80053159598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80053159598&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-23854-3_20

DO - 10.1007/978-3-642-23854-3_20

M3 - Conference contribution

SN - 9783642238536

VL - 6883 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 187

EP - 196

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -