{"id":"https://openalex.org/W2189179647","doi":null,"title":"An Algorithm for Multi-objective Linear plus Fractional Program","display_name":"An Algorithm for Multi-objective Linear plus Fractional Program","alternate_titles":[],"publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2189179647","mag":"2189179647"},"language":"en","primary_location":{"id":"mag:2189179647","doi":null,"is_oa":false,"landing_page_url":"http://www.asor.org.au/publication/files/jun2009/ASOR-Bulletin-Jun-2009.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2189179647"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sanjay Jain","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Sanjay Jain","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5047666790","display_name":"Kailash Lachhwani","orcid":"https://orcid.org/0000-0002-2209-2191","observed_orcids":["https://orcid.org/0000-0002-2209-2191"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Kailash Lachhwani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.7839999794960022},{"id":"https://openalex.org/keywords/fuzzy-programming","display_name":"fuzzy programming","score":0.8889999985694885},{"id":"https://openalex.org/keywords/membership-functions","display_name":"membership functions","score":0.6859999895095825},{"id":"https://openalex.org/keywords/compromise-solution","display_name":"compromise solution","score":0.7179999947547913},{"id":"https://openalex.org/keywords/parallel-hyperplanes","display_name":"parallel hyperplanes","score":0.7919999957084656}],"concepts":[{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.6472175121307373},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6454563140869141},{"id":"https://openalex.org/C199631012","wikidata":"https://www.wikidata.org/wiki/Q205034","display_name":"Perpendicular","level":2,"score":0.6379119157791138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6271449327468872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5983483791351318},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5478522181510925},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4619951546192169},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.42910999059677124},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4199875593185425},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2503247857093811},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1156933605670929},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2189179647","doi":null,"is_oa":false,"landing_page_url":"http://www.asor.org.au/publication/files/jun2009/ASOR-Bulletin-Jun-2009.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1965767627","https://openalex.org/W1977153588","https://openalex.org/W1978415596","https://openalex.org/W1995184299","https://openalex.org/W1995342995","https://openalex.org/W2035458184","https://openalex.org/W2048714900","https://openalex.org/W2068656912","https://openalex.org/W2077426186","https://openalex.org/W2084308903","https://openalex.org/W2264882411","https://openalex.org/W2771903095"],"related_works":["https://openalex.org/W2259864519","https://openalex.org/W7096752892","https://openalex.org/W3085312354","https://openalex.org/W3034456946","https://openalex.org/W2002133183","https://openalex.org/W2185510850","https://openalex.org/W2109203413","https://openalex.org/W2057364772","https://openalex.org/W2010975609","https://openalex.org/W2085222377"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"develop":[4],"an":[5],"algorithm":[6,33],"to":[7,86],"solve":[8],"multiobjective":[9],"linear":[10],"plus":[11],"fractional":[12],"program":[13,27],"(MOL+FP)":[14],"i.e.":[15],"()":[16,17,18],"g":[19],"X":[20],"fX":[21],"hX":[22],"+":[23],"by":[24],"converting":[25],"MOL+FP":[26],"into":[28],"fuzzy":[29],"programming":[30],"problem.":[31],"The":[32],"works":[34],"for":[35],"the":[36,39,43,48,52,88],"minimization":[37,65],"of":[38,51,64,66],"perpendicular":[40,68,79],"distances":[41],"between":[42],"parallel":[44],"hyper":[45],"planes":[46],"at":[47],"optimum":[49,57],"points":[50],"objective":[53],"functions.":[54],"A":[55],"compromise":[56],"solution":[58],"is":[59],"obtained":[60],"as":[61,76],"a":[62,77],"result":[63],"supremum":[67,78],"distance.":[69,80],"Suitable":[70],"membership":[71],"function":[72],"has":[73,83],"been":[74,84],"defined":[75],"Numerical":[81],"example":[82],"considered":[85],"support":[87],"developed":[89],"algorithm.":[90]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2189179647","counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
