Equivalence of vertical block linear complementarity problems and multi-objective programming problems

In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of information & optimization sciences Ročník 31; číslo 2; s. 245 - 255
Hlavní autoři: Chakraborty, B., Biswal, M.P., Nanda, S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Delhi Taylor & Francis Group 01.03.2010
Taru Publications
Témata:
efficient solution
Mathematical programming
minimax optimization problem
multi-objective programming problem
Optimization algorithms
Problem solving
Studies
Vertical-block linear complementarity problem
weighted problem
ISSN:0252-2667, 2169-0103
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero efficient point of the MOP problem. Also a perturbed problem is proposed if the VLCP is unsolvable for small disturbances in data. This perturbed problem is useful to construct the solvable VLCP corresponding to the original unsolvable VLCP. Examples are given to demonstrate the effectiveness of the results.
AbstractList In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero efficient point of the MOP problem. Also a perturbed problem is proposed if the VLCP is unsolvable for small disturbances in data. This perturbed problem is useful to construct the solvable VLCP corresponding to the original unsolvable VLCP. Examples are given to demonstrate the effectiveness of the results.
In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to look into the solvability and unsolvability of the VLCP. The characterization of an unsolvable VLCP is obtained via the existence of nonzero efficient point of the MOP problem. Also a perturbed problem is proposed if the VLCP is unsolvable for small disturbances in data. This perturbed problem is useful to construct the solvable VLCP corresponding to the original unsolvable VLCP. Examples are given to demonstrate the effectiveness of the results. [PUBLICATION ABSTRACT]
Author Chakraborty, B.
Nanda, S.
Biswal, M.P.
Author_xml – sequence: 1
  givenname: B.
  surname: Chakraborty
  fullname: Chakraborty, B.
  email: bidushijana@yahoo.com
  organization: Department of Mathematics , Indian Institute of Technology
– sequence: 2
  givenname: M.P.
  surname: Biswal
  fullname: Biswal, M.P.
  organization: Department of Mathematics , Indian Institute of Technology
– sequence: 3
  givenname: S.
  surname: Nanda
  fullname: Nanda, S.
  organization: Department of Mathematics , Indian Institute of Technology
BookMark eNqFkE1vAiEQhkljk6rtX2hI72uBVZCjMfYjMemlPRNgwWBZUFht_Pdla-21p8nMPDPvzDsCgxCDAeAeowlGc_SIyIwQStmEoJ8S5ZzP2BUYEkx5VWr1AAx7qOqpGzDKeYvQlFPEhsCu9gd3lN4EbWC08GhS57T0UPmoP6F3wcgEdWx33rQmdDK57gR3KaqSZyhDA9uD71wV1dbozh1N39wk2bYubP7AW3Btpc_m7jeOwcfT6n35Uq3fnl-Xi3WlCWZdORDrhmNdN5LWuNHz2jSUMYypJNM5t1gphZCqrUIKGT4zUiKqrFQ1w2haGmPwcN5bhPcHkzuxjYcUiqRghJSfKaIFomdIp5hzMlbskmtlOgmMRG-puFgqekvFxdIyuDgPumBjauVXTL4RnTz5mGySQbss6n92fANFVYHu
Cites_doi 10.1007/s10107-003-0473-8
10.1007/BFb0120784
10.1016/S0021-9800(70)80010-2
10.1007/BF01580619
10.1016/B978-0-12-597050-1.50016-6
10.1016/j.ejor.2003.06.014
10.1287/mnsc.11.7.681
10.1007/BF02192086
10.1016/0024-3795(95)00091-5
10.1080/02331939908844452
10.1137/0112033
ContentType Journal Article
Copyright Copyright Taru Publications 2010
Copyright Taru Publications Mar 2010
Copyright_xml – notice: Copyright Taru Publications 2010
– notice: Copyright Taru Publications Mar 2010
DBID AAYXX
CITATION
JQ2
DOI 10.1080/02522667.2010.10699957
DatabaseName CrossRef
ProQuest Computer Science Collection
DatabaseTitle CrossRef
ProQuest Computer Science Collection
DatabaseTitleList
ProQuest Computer Science Collection
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2169-0103
EndPage 255
ExternalDocumentID 2092425091
10_1080_02522667_2010_10699957
10699957
Genre Feature
GroupedDBID -~X
29K
30N
4.4
5GY
ABCCY
ABFIM
ABJNI
ABPEM
ABTAI
ABXYU
ACGFS
ACTIO
ADCVX
AEYOC
AGDLA
AIJEM
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
D-I
DGEBU
DKSSO
EBS
EJD
E~A
E~B
GTTXZ
H13
HZ~
H~P
KYCEM
M4Z
O9-
P2P
PQQKQ
PZZ
S-T
SJN
SNACF
TDBHL
TFW
TN5
TTHFI
UT5
.DC
AAIKQ
AAKBW
AAYXX
ACAGQ
ACFPA
ADXHL
AGLEN
AGROQ
ALCKM
AMATQ
AMXXU
BCCOT
BPLKW
C06
CITATION
CRFIH
DMQIW
DWIFK
IPNFZ
IVXBP
LJTGL
NUSFT
QCRFL
TAQ
TFMCV
TOXWX
JQ2
ID FETCH-LOGICAL-c217t-261cd91c3da631dc83ed677116a2489f1bbb00b3fb0b0e95eaa06bfab371040b3
IEDL.DBID TFW
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000420610400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0252-2667
IngestDate Mon Jun 30 06:49:08 EDT 2025
Sat Nov 29 03:19:13 EST 2025
Mon Oct 20 23:34:58 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c217t-261cd91c3da631dc83ed677116a2489f1bbb00b3fb0b0e95eaa06bfab371040b3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 722496606
PQPubID 43911
PageCount 11
ParticipantIDs informaworld_taylorfrancis_310_1080_02522667_2010_10699957
crossref_primary_10_1080_02522667_2010_10699957
proquest_journals_722496606
PublicationCentury 2000
PublicationDate 20100301
PublicationDateYYYYMMDD 2010-03-01
PublicationDate_xml – month: 03
  year: 2010
  text: 20100301
  day: 01
PublicationDecade 2010
PublicationPlace Delhi
PublicationPlace_xml – name: Delhi
PublicationTitle Journal of information & optimization sciences
PublicationYear 2010
Publisher Taylor & Francis Group
Taru Publications
Publisher_xml – name: Taylor & Francis Group
– name: Taru Publications
References Cottle R.W. (CIT0004) 1983
Murty K.G. (CIT0017) 1988
Chankong V. (CIT0001) 1983
Kostreva M.M. (CIT0010) 2004; 158
Mangasarian O.L. (CIT0014) 1979; 31
Lemke C.E. (CIT0012) 1965; 11
Isac G. (CIT0008) 1995; 86
Ebiefung A.A. (CIT0006) 1995; 69
Mangasarian O.L. (CIT0015) 1997
Cottle R.W. (CIT0002) 1970; 8
Kostreva M.M. (CIT0009) 1993; 60
Cottle R.W. (CIT0003) 1978; 7
Lemke C.E. (CIT0013) 1970
Bhatia D. (CIT0018) 1999; 46
Ebiefung A.A. (CIT0005) 1995; 223
Mohan S.R. (CIT0016) 2004; 100
Lemke C.E. (CIT0011) 1964; 12
Steuer R. (CIT0019) 1986
Ebiefung A.A. (CIT0007) 1992
References_xml – volume: 100
  start-page: 339
  year: 2004
  ident: CIT0016
  publication-title: Mathematical Programming Series A
  doi: 10.1007/s10107-003-0473-8
– volume: 7
  start-page: 88
  year: 1978
  ident: CIT0003
  publication-title: Mathematical Programming Study
  doi: 10.1007/BFb0120784
– start-page: 226
  volume-title: in Complementarity and Variational Problems: State of the Art
  year: 1997
  ident: CIT0015
– volume-title: The Linear Complementarity Problem
  year: 1983
  ident: CIT0004
– volume: 8
  start-page: 79
  issue: 1
  year: 1970
  ident: CIT0002
  publication-title: J. Combin. Theory
  doi: 10.1016/S0021-9800(70)80010-2
– volume-title: Linear Complementarity, Linear and Non-linear Programming
  year: 1988
  ident: CIT0017
– volume-title: Multi-objective Decision Making: Theory and Methodology
  year: 1983
  ident: CIT0001
– volume: 69
  start-page: 255
  year: 1995
  ident: CIT0006
  publication-title: Mathematical Programming
– volume-title: in Recent Advances in Global Optimization
  year: 1992
  ident: CIT0007
– volume: 60
  start-page: 349
  year: 1993
  ident: CIT0009
  publication-title: Mathematical Programming
  doi: 10.1007/BF01580619
– start-page: 349
  volume-title: in Nonlinear Programming
  year: 1970
  ident: CIT0013
  doi: 10.1016/B978-0-12-597050-1.50016-6
– volume: 158
  start-page: 409
  year: 2004
  ident: CIT0010
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2003.06.014
– volume: 31
  start-page: 393
  year: 1979
  ident: CIT0014
  publication-title: Operations Research Verfahren
– volume: 11
  start-page: 681
  year: 1965
  ident: CIT0012
  publication-title: Management Science
  doi: 10.1287/mnsc.11.7.681
– volume: 86
  start-page: 389
  year: 1995
  ident: CIT0008
  publication-title: Journal of Optimization Theory and Applications
  doi: 10.1007/BF02192086
– volume: 223
  start-page: 155
  year: 1995
  ident: CIT0005
  publication-title: Linear Algebra and its Applications
  doi: 10.1016/0024-3795(95)00091-5
– volume: 46
  start-page: 199
  year: 1999
  ident: CIT0018
  publication-title: Optimization
  doi: 10.1080/02331939908844452
– volume: 12
  start-page: 413
  year: 1964
  ident: CIT0011
  publication-title: SIAM Journal on Applied Mathematics
  doi: 10.1137/0112033
– volume-title: Multiple Criteria Optimization: Theory, Computation and Applications
  year: 1986
  ident: CIT0019
SSID ssj0049607
Score 1.7195871
Snippet In this paper, Multi-objective Programming (MOP) approaches are proposed to deal with the feasible Vertical Block Linear Complementarity Problems (VLCP) and to...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Index Database
Publisher
StartPage 245
SubjectTerms efficient solution
Mathematical programming
minimax optimization problem
multi-objective programming problem
Optimization algorithms
Problem solving
Studies
Vertical-block linear complementarity problem
weighted problem
Title Equivalence of vertical block linear complementarity problems and multi-objective programming problems
URI https://www.tandfonline.com/doi/abs/10.1080/02522667.2010.10699957
https://www.proquest.com/docview/722496606
Volume 31
WOSCitedRecordID wos000420610400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 2169-0103
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0049607
  issn: 0252-2667
  databaseCode: TFW
  dateStart: 19800101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYmChPEUpIA-sVuPm4YQNoVYMqFOBbpHPsaWCaKFJ-f2c7Ri1QogBxiixE93zc_TdHSFXwiAKkBmwfKAilsQQMSlFxfIkkdpIJZUbB_R4L8bjfDot1mthLK3SnqGNbxThYrV1bgl1YMT1MU0jaMiEJ2bhmQZBTmoLyhHaWyOfjJ5CME4QoLuKaVzC7JpQJPzjNhv5aaN76bdo7VLQqPMfH79P9loASm-8xRyQLT0_JJ0w3IG2vn5EzPB9NUMztFd0Yaib24wKpYDp74XaN8sldYx0T0C3U_BoO5-mpvh91JEV2QKefVClLRfsFbPl14PH5GE0nNzesXYoA1N4emlQiFxVBVdxJbOYVyqPdZUJwXkmB0leGA6AngyxgQgiXaRayigDIyFGLJPgjROyPV_M9SmhUkNaCR0BmgiitgEYpVOuTT7QXAuQXdIPqijffO-NkoeWpq0YSyvGMoixS67XNVY27q-H8SNKyvi3xb2g37J15LoUCHFsA9Ps7C9b98iuZx1Y7to52W6WK31BdtRHM6uXl85iPwEhVOsZ
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1JSwMxFH7UKujFXax1ycHr4GS2TL2JtCjW4qEut5BkElCx1Xbq7_clMxGLiAc9DjPJhLd-CV_eAzhmBlGAyGSQRyoMkliGgRCsCPIkEdoIJZRrB3TXZ4NB_vDQuWnAub8LY2mVdg9tqkIRLlZb57aH0Z4Sd4J5GlFDxipmFm5qEOWkbAEWU0y2ltc37N37cJwgRHd3pnFMYAf5a8I_zjOXoebql36L1y4J9db-ZfnrsFpjUHJWGc0GNPRoE9Z8fwdSu_sWmO7b7BEt0T6RsSGudTPqlEjMgM_E_lpMiCOlVxx02wiP1C1qpgQXSBxfMRjLpyqukpoO9oIJ8_PDbbjtdYfnF0HdlyFQuIEpUYpUFR2q4kJkMS1UHusiY4zSTERJ3jFUSnRmGRsZylB3Ui1EmEkjZIxwJsEXO9AcjUd6F4jQMi2YDiVaCQK3SBqlU6pNHmmqmRQtOPG64K9V-Q1OfVXTWozcipF7Mbbg9KvKeOkOPkzVpYTHvw1uewXz2pennCHKsTVMs72_TH0EyxfD6z7vXw6u2rBSkRAslW0fmuVkpg9gSb2Xj9PJoTPfD-vJ7zo
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LS8MwGA86Rbw4nzjnIwevYU1fab2JriiO4WHqbiFJE1Bxm1vn3--XtJUNEQ96LG3S8D1_Cb98H0LnzAAKELEkia88EgbSI0KwnCRhKLQRSijXDuixx_r9ZDhMF-_CWFql3UObslCEi9XWuSe5qRlxHUjTABpiVhKzYE8DICdiq2jNVccCmx5kT3U0DgGhuyvTMIbYQfUt4R_nWUpQS-VLv4Vrl4Oy5n-sfhttVQgUX5Yms4NW9GgXNevuDrhy9j1kuu_zZ7BD-4THBrvGzaBRLCH_vWL7ZzHFjpJeMtBtGzxcNaiZYVgfdmxFMpYvZVTFFRnsDdLl14f76CHrDq5uSNWVgSjYvhQgRKrylKogF3FAc5UEOo8ZozQWfpikhkoJriwDIz3p6TTSQnixNEIGAGZCeHGAGqPxSB8iLLSMcqY9CTYCsM2XRumIapP4mmomRQt1alXwSVl8g9O6pmklRm7FyGsxttDFosZ44Y49TNmjhAe_DW7X-uWVJ884A4xjK5jGR3-Z-gxt3F9nvHfbv2ujzZKBYHlsx6hRTOf6BK2rj-J5Nj11xvsJBSLt3g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Equivalence+of+vertical+block+linear+complementarity+problems+and+multi-objective+programming+problems&rft.jtitle=Journal+of+information+%26+optimization+sciences&rft.au=Chakraborty%2C+B&rft.au=Biswal%2C+M+P&rft.au=Nanda%2C+S&rft.date=2010-03-01&rft.pub=Taru+Publications&rft.issn=0252-2667&rft.eissn=2169-0103&rft.volume=31&rft.issue=2&rft.spage=245&rft_id=info:doi/10.1080%2F02522667.2010.10699957&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2092425091
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0252-2667&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0252-2667&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0252-2667&client=summon