Algorithms for Separable Nonlinear Resource Allocation Problems

A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objectiv...

Full description

Saved in:
Bibliographic Details
Published in:Operations research Vol. 46; no. 2; p. 272
Main Authors: Kodialam, Muralidharan S, Luss, Hanan
Format: Journal Article
Language:English
Published: Linthicum Institute for Operations Research and the Management Sciences 01.03.1998
Subjects:
ISSN:0030-364X, 1526-5463
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objective is to minimize the sum of the performance functions, subject to satisfying the resource constraint and nonnegativity constraints. This problem extends the well-studied problem in which the resource constraint is linear. Several algorithms are presented to solve the problem. These algorithms extend approaches developed for the linearly constrained problem. They can readily solve large problems magnifying the optimal solution in a number of iterations that does not exceed the number of variables. Several examples are provided for illustration purposes, occupational result are presented, and the similarities and differences among the algorithms are highlighted.
AbstractList A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex performance functions, 1 for each activity. Likewise, the constraint has separable, convex resource-usage functions, 1 for each activity. The objective is to minimize the sum of the performance functions, subject to satisfying the resource constraint and nonnegativity constraints. This problem extends the well-studied problem in which the resource constraint is linear. Several algorithms are presented to solve the problem. These algorithms extend approaches developed for the linearly constrained problem. They can readily solve large problems magnifying the optimal solution in a number of iterations that does not exceed the number of variables. Several examples are provided for illustration purposes, occupational result are presented, and the similarities and differences among the algorithms are highlighted.
Author Kodialam, Muralidharan S
Luss, Hanan
Author_xml – sequence: 1
  givenname: Muralidharan
  surname: Kodialam
  middlename: S
  fullname: Kodialam, Muralidharan S
– sequence: 2
  givenname: Hanan
  surname: Luss
  fullname: Luss, Hanan
BookMark eNotjktLxDAUhYOMYGd06T64b01y06RZSRl8waDiA9wNaXqrHTLJmHT-vwVdnc35zneWZBFiQEIuOau4aPR1PCSspKpEJbQ4IQWvhSprqWBBCsaAlaDk5xlZ5rxjjJla1QW5af1XTOP0vc90iIm-4cEm23mkTzH4MaBN9BVzPCaHtPU-OjuNMdCXFOfSPp-T08H6jBf_uSIfd7fv64dy83z_uG43pQNtprI32grOnXQD0wC8g7oZrHKSdU720qBsjBGN1Wh4A04bNXPDYE0vHSBIWJGrv91Dij9HzNN2N38Ks3IruOFCCcbhF3R1TKw
CODEN OPREAI
CitedBy_id crossref_primary_10_1016_S0305_0548_00_00089_7
crossref_primary_10_1016_j_ejor_2007_07_005
crossref_primary_10_1016_j_ejor_2009_01_043
crossref_primary_10_1016_S0377_2217_01_00179_5
crossref_primary_10_1080_0740817X_2010_532852
crossref_primary_10_1080_0305215X_2011_646263
crossref_primary_10_1002_net_21587
crossref_primary_10_1007_s10898_005_3843_3
crossref_primary_10_1002_nav_10089
crossref_primary_10_1016_j_ejor_2015_01_029
crossref_primary_10_1016_S0951_8320_02_00047_9
crossref_primary_10_1016_j_ejor_2007_10_060
crossref_primary_10_1016_j_tre_2023_103170
crossref_primary_10_1002_nav_21603
crossref_primary_10_1016_j_apm_2011_10_017
crossref_primary_10_1080_10556788_2023_2296982
crossref_primary_10_1142_S0217595912500315
crossref_primary_10_1016_j_ejor_2005_09_046
crossref_primary_10_1016_j_ijpe_2018_05_027
crossref_primary_10_1016_j_ejor_2007_01_053
crossref_primary_10_1287_opre_49_6_913_10023
crossref_primary_10_1080_07408170008963916
crossref_primary_10_1080_16258312_2022_2082850
crossref_primary_10_1007_s10589_007_9113_1
crossref_primary_10_1111_poms_13275
crossref_primary_10_1007_s10898_005_1678_6
crossref_primary_10_1080_07408170008963897
crossref_primary_10_1016_j_ijpe_2023_108900
crossref_primary_10_1016_j_ejor_2005_08_008
crossref_primary_10_1016_j_mcm_2012_10_026
crossref_primary_10_1080_07408170108936899
crossref_primary_10_1007_s10957_024_02503_5
crossref_primary_10_1016_j_csda_2005_06_015
crossref_primary_10_1016_j_ejor_2007_08_044
crossref_primary_10_1016_j_ejor_2006_12_006
crossref_primary_10_1007_s11424_014_2183_0
crossref_primary_10_1007_s11590_011_0288_0
crossref_primary_10_1080_07408170590918254
ContentType Journal Article
Copyright Copyright Institute for Operations Research and the Management Sciences Mar/Apr 1998
Copyright_xml – notice: Copyright Institute for Operations Research and the Management Sciences Mar/Apr 1998
DBID 3V.
7WY
7WZ
7X7
7XB
87Z
88E
88F
8AL
8AO
8FE
8FG
8FI
8FJ
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
FYUFA
F~G
GHDGH
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
K9.
L.-
L6V
M0C
M0N
M0S
M1P
M1Q
M2O
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1287/opre.46.2.272
DatabaseName ProQuest Central (Corporate)
ABI/INFORM Collection (ProQuest)
ABI/INFORM Global (PDF only)
Health & Medical Collection (ProQuest)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Medical Database (Alumni Edition)
Military Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Hospital Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
Health Research Premium Collection
ABI/INFORM Global (Corporate)
Health Research Premium Collection (Alumni)
ProQuest Central Student
Research Library Prep
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Global
Computing Database
ProQuest Health & Medical Collection
Medical Database
Military Database (ProQuest)
Research Library (ProQuest)
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest Military Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
Health Research Premium Collection
Health & Medical Research Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
ProQuest Business Collection
ProQuest Hospital Collection (Alumni)
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Health & Medical Research Collection
ProQuest Engineering Collection
Health and Medicine Complete (Alumni Edition)
ProQuest Central Korea
ProQuest Research Library
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest Military Collection (Alumni Edition)
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest Medical Library
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Computer Science
Business
EISSN 1526-5463
ExternalDocumentID 29737902
GroupedDBID -DZ
-~X
123
18M
1OL
29N
2AX
3V.
4.4
7WY
7X7
7XB
85S
88E
8AL
8AO
8FE
8FG
8FI
8FJ
8FK
8FL
8G5
8V8
AAAZS
AABCJ
AAWTO
AAXLS
ABAWQ
ABBHK
ABDPE
ABEFU
ABJCF
ABKVW
ABLWH
ABPPZ
ABUWG
ABWPA
ABXSQ
ABYYQ
ACGFO
ACHJO
ACHQT
ACIWK
ACNCT
ACXJH
ADBBV
ADEPB
ADGDI
ADMHG
ADNFJ
ADNWM
ADULT
AEGXH
AEMOZ
AENEX
AEUPB
AFAIT
AFKRA
AFTQD
AGKTX
AHAJD
AHQJS
AIAGR
AKVCP
ALMA_UNASSIGNED_HOLDINGS
APTMU
ARAPS
ASMEE
AZQEC
BENPR
BEZIV
BGLVJ
BPHCQ
BVXVI
CBXGM
CCKSF
CCPQU
CS3
CYVLN
DWQXO
EBA
EBE
EBO
EBR
EBS
EBU
EJD
EMI
F5P
FRNLG
FYUFA
GENNL
GNUQQ
GROUPED_ABI_INFORM_RESEARCH
GUPYA
GUQSH
HCIFZ
HF~
HGD
HVGLF
IAO
ICJ
IEA
IOF
IPSME
JAAYA
JAV
JBC
JBMMH
JBZCM
JENOY
JHFFW
JKQEH
JLEZI
JLXEF
JPL
JPPEU
JQ2
JST
K1G
K60
K6V
K6~
K7-
K9.
L.-
L6V
M0C
M0N
M1P
M1Q
M2O
M7S
MBDVC
MV1
N95
NIEAY
P2P
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRG
PRINS
PROAC
PSQYO
PTHSS
Q9U
RNS
RPU
SA0
TAE
TH9
TN5
U5U
UKHRP
WH7
XSW
Y99
YHZ
YNT
YYP
ZCG
ZY4
~02
~92
ID FETCH-LOGICAL-c379t-d97a211c4cf07331b358fa6c40bc4d49e489928a7e9183c796c37ffa9d4c3e343
IEDL.DBID M7S
ISICitedReferencesCount 43
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000075763500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0030-364X
IngestDate Thu Oct 30 04:41:27 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c379t-d97a211c4cf07331b358fa6c40bc4d49e489928a7e9183c796c37ffa9d4c3e343
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 219126201
PQPubID 37962
ParticipantIDs proquest_journals_219126201
PublicationCentury 1900
PublicationDate 1998-03-01
PublicationDateYYYYMMDD 1998-03-01
PublicationDate_xml – month: 03
  year: 1998
  text: 1998-03-01
  day: 01
PublicationDecade 1990
PublicationPlace Linthicum
PublicationPlace_xml – name: Linthicum
PublicationTitle Operations research
PublicationYear 1998
Publisher Institute for Operations Research and the Management Sciences
Publisher_xml – name: Institute for Operations Research and the Management Sciences
SSID ssj0009565
Score 1.7144121
Snippet A simple resource allocation problem with a single resource constraint is considered. The objective function is composed of several separable, convex...
SourceID proquest
SourceType Aggregation Database
StartPage 272
SubjectTerms Algorithms
Nonlinear programming
Operations research
Resource allocation
Studies
Theory
Title Algorithms for Separable Nonlinear Resource Allocation Problems
URI https://www.proquest.com/docview/219126201
Volume 46
WOSCitedRecordID wos000075763500009&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1BT8IwFH4RMEYPIqhRUdKDBz0MtrW024kgwZgYEUUjeiFd16oJgrLp77cdncGLFy8v6ZalS9f39b327fsAjgMRUZ2jUUcEXDpEEI2DXEkHY-XFkRspqtxMbIL1-8FoFA5sbU5iyypzTMyAOp4Js0fe1J7lGfJ0r_3-4RjRKHO4ahU0ClAyJAleVrk3XOLcpQsBA6yhhpKRpdjUOULTKIw0CG34DT_jBv4Nw9nacl7-51ttwaYNKlFnMQsqsCKnVVjLa9qrUM61G5B15SpsLBERVqFiryfoxPJQn25DuzN51p2lL28J0qEtGkrDEx5NJOov-DX4HOW7_6gzMaui-cposNCoSXbg_rx3171wrN6CIzALUycOGdf5oCBCZVKOEW4FilNB3EiQmISS6OTMDziToQYCwUKqn1OKhzERWGKCd6E4nU3lHiAXx0r6klMdP5Ig8njIpGI-b8VR4AkV70MtH8-xdZpk_DOYB3_ercF6_mOg6x1CMZ1_yiNYFV_pazKvQ4E9PBo7YnUonfX6g1vdumSOtldu11jvxlj_up5NF20HradvUSfDvw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTsMwFHyCglgOlAYQOz6ABIeUJHbt5IBQxSJQS1SJIvVWHMcGpFKgCSA-in_EzoLgwq0HrokSyX7P4zdeZgB2fRFRzdGoLXwubSKIxkGupI2xcuPIiRRVTmY2wcLQ7_WCzgR8lndhzLHKEhMzoI6fhFkjP9QjyzXi6e7x84ttTKPM5mrpoJFnRUt-vGvGlhxdnurw7nne-Vn35MIuTAVsgVmQ2nHAuCY9ggiV-RVGuOErTgVxIkFiEkiiGYjncyYDne2CBVR_pxQPYiKwxATr_07CFME-M8OqxewfGr80N0zAGtoo6RWSnpqTHBpHkzqhda_uZVrEv2E_m8vOq_-sFxZhoSiaUTPP8hpMyKEFM-WZfQuqpTcFKqDKgvkfQosW1IrnCdovdLYPluC4ObjTjUvvHxOkS3d0LY0OejSQKMz1Q_gIlbsbqDkws77JYtTJPXiSZbgZS6NXoDJ8GspVQA6OlfQkp7o-Jn7k8oBJxTzeiCPfFSpeg40yfv0CFJL-d_DW_3y7A7MX3at2v30ZtjZgrrwE6bibUElHr3ILpsVb-pCMtrP0Q3A77kh_Ad5zF9c
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LSsNAFL3UB6ILH1VR62MWCrpIm2Smk2QhpajFooSCCsVNnUxmVKhVm6j4af6dd_IQ3bhz4TYhgcm9c-aezJ1zAHZ9GXHkaNySvlAWkwxxUGhlUaqdOLIjzbWdmU14Yej3-0GvAh_lWRjTVlliYgbU8aM0_8gbOLMcI57uNHTRFdE77rSeni1jIGU2Wks3jTxDztT7G7K35LB7jKHec93OyeXRqVUYDFiSekFqxYEnkABJJnXmXRjRpq8Fl8yOJItZoBiyEdcXngow86UXcHxOaxHETFJFGcX3TsCUhxTTdBP2mtff9H55bp5AEeY46xfynshPGsbdpM543a27mS7xzyUgW9c6C__4iyzCfFFMk3ae_UtQUaMqzJS9_FVYKD0rSAFhVZj7JsBYhaXiekL2C_3tg2VotYe3OLj07iEhWNKTC2X00aOhImGuKyLGpNz1IO2hqQZMdpNe7s2TrMDVnwx6FSZHjyO1BsSmsVauEhzrZuZHjgg8pT1XNOPId6SO16FWxnJQgEUy-Arkxq93d2AGAzw474ZnNZgtz0baziZMpuMXtQXT8jW9T8bbWSYSuPnrQH8CjMwg-w
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=Algorithms+for+Separable+Nonlinear+Resource+Allocation+Problems&rft.jtitle=Operations+research&rft.au=Kodialam%2C+Muralidharan+S&rft.au=Luss%2C+Hanan&rft.date=1998-03-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0030-364X&rft.eissn=1526-5463&rft.volume=46&rft.issue=2&rft.spage=272&rft_id=info:doi/10.1287%2Fopre.46.2.272&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=29737902
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-364X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-364X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-364X&client=summon