Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
Judice, J. and Faustino, A. (1994) The Linear Quadratic Bi-Level Programming Problem. INFOR, 32, 87-98. https://doi.org/10.1080/03155986.1994.11732240
has been cited by the following article:
TITLE: An Alternative Approach for Solving Bi-Level Programming Problems
AUTHORS: Rashmi Birla, Vijay K. Agarwal, Idrees A. Khan, Vishnu Narayan Mishra
KEYWORDS: Linear Programming Problem, Bi-Level Programming Problem, Graph, Algorithm
JOURNAL NAME: American Journal of Operations Research, Vol.7 No.3, May 27, 2017
ABSTRACT: An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper.
Related Articles:
A New Heuristic for the Convex Quadratic Programming Problem
Elias Munapo, Santosh Kumar
DOI: 10.4236/ajor.2015.55031 4,237 Downloads 5,017 Views Citations
Pub. Date: September 2, 2015
A New Numerical Method for Solving the Stokes Problem Using Quadratic Programming
M. Baymani, A. Kerayechian
DOI: 10.4236/iim.2012.23023 4,008 Downloads 7,393 Views Citations
Pub. Date: March 31, 2010
Minimizing Complementary Pivots in a Simplex-Based Solution Method for a Quadratic Programming Problem
Elias Munapo
DOI: 10.4236/ajor.2012.23037 5,277 Downloads 8,117 Views Citations
Pub. Date: September 19, 2012
Solving the Interval-Valued Linear Fractional Programming Problem
Sohrab Effati, Morteza Pakdaman
DOI: 10.4236/ajcm.2012.21006 6,686 Downloads 13,477 Views Citations
Pub. Date: March 21, 2012
An Approach to Solve a Possibilistic Linear Programming Problem
Ritika Chopra, Ratnesh R. Saxena
DOI: 10.4236/am.2014.52024 3,775 Downloads 5,876 Views Citations
Pub. Date: January 17, 2014
