{"id":"https://openalex.org/W40048049","doi":"https://doi.org/10.5860/choice.38-2787","title":"Practical optimization methods: with Mathematica applications","display_name":"Practical optimization methods: with Mathematica applications","alternate_titles":[],"publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W40048049","doi":"https://doi.org/10.5860/choice.38-2787","mag":"40048049"},"language":"en","primary_location":{"id":"doi:10.5860/choice.38-2787","doi":"https://doi.org/10.5860/choice.38-2787","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.38-2787","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W40048049"],"child_works_count":0,"type":"book-review","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"05","first_page":"38-2787","last_page":"38-2787"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9907000064849854,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9907000064849854,"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"}},{"id":"https://openalex.org/T13806","display_name":"Mathematical and Computational Methods","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.003100000089034438,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/optimization","display_name":"optimization","score":0.7369999885559082},{"id":"https://openalex.org/keywords/mathematical-programming","display_name":"mathematical programming","score":0.5979999899864197},{"id":"https://openalex.org/keywords/graphical-optimization","display_name":"graphical optimization","score":0.7080000042915344},{"id":"https://openalex.org/keywords/optimality-conditions","display_name":"optimality conditions","score":0.8090000152587891},{"id":"https://openalex.org/keywords/karush-kuhn-tucker-conditions","display_name":"Karush-Kuhn-Tucker conditions","score":0.9909999966621399},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.6600000262260437},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9739999771118164},{"id":"https://openalex.org/keywords/revised-simplex-method","display_name":"revised simplex method","score":0.9599999785423279},{"id":"https://openalex.org/keywords/interior-point-methods","display_name":"interior point methods","score":0.8859999775886536},{"id":"https://openalex.org/keywords/affine-scaling","display_name":"affine scaling","score":0.7310000061988831},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"quadratic programming","score":0.9290000200271606},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.6539999842643738},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.5120000243186951},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.8140000104904175},{"id":"https://openalex.org/keywords/lagrangian-duality","display_name":"Lagrangian duality","score":0.8880000114440918},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.5929999947547913},{"id":"https://openalex.org/keywords/unconstrained-optimization","display_name":"unconstrained optimization","score":0.7799999713897705},{"id":"https://openalex.org/keywords/time-value-of-money","display_name":"time value of money","score":0.7870000004768372},{"id":"https://openalex.org/keywords/numerical-optimization-algorithms","display_name":"numerical optimization algorithms","score":0.3580000102519989},{"id":"https://openalex.org/keywords/post-optimality-analysis","display_name":"post-optimality analysis","score":0.6499999761581421}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6224402785301208}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5860/choice.38-2787","doi":"https://doi.org/10.5860/choice.38-2787","is_oa":false,"landing_page_url":"https://doi.org/10.5860/choice.38-2787","pdf_url":null,"source":{"id":"https://openalex.org/S2764375719","display_name":"Choice Reviews Online","issn_l":"0009-4978","issn":["0009-4978","1523-8253","1943-5975"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310316146","host_organization_name":"Association of College and Research Libraries","host_organization_lineage":["https://openalex.org/P4310316146","https://openalex.org/P4310315903"],"host_organization_lineage_names":["Association of College and Research Libraries","American Library Association"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Choice Reviews Online","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2497404590","https://openalex.org/W4234225051","https://openalex.org/W4252663938"],"related_works":["https://openalex.org/W648446685","https://openalex.org/W1519405745","https://openalex.org/W2063606977","https://openalex.org/W2471988522","https://openalex.org/W2993002393","https://openalex.org/W2796980597","https://openalex.org/W4241054179","https://openalex.org/W592715486","https://openalex.org/W2009770514","https://openalex.org/W4415089787"],"abstract_inverted_index":{"1":[0],"Optimization":[1,5,14,19,44,74],"Problem":[2,6],"Formulation.-":[3,7],"1.1":[4],"1.2":[8],"The":[9,88,146,165,180,208,214,239,248],"Standard":[10,147,205,236],"Form":[11],"of":[12,18,24,63,91,100,155,160,269,291],"an":[13,161],"Problem.-":[15,149,163,266,294],"1.3":[16],"Solution":[17,62],"Problems.-":[20,30,47,75,77,86,111,120,123,141,196,228,279,283,309],"1.4":[21],"Time":[22],"Value":[23],"Money.-":[25],"1.5":[26],"Concluding":[27,138,193,220],"Remarks.-":[28,139,194,221],"1.6":[29],"2":[31],"Graphical":[32,37,43],"Optimization.-":[33,38],"2.1":[34],"Procedure":[35],"for":[36,84,109,204,235,244,251,262,274],"2.2":[39],"GraphicalSolution":[40],"function.-":[41],"2.3":[42],"Examples.-":[45],"2.4":[46],"3":[48],"Mathematical":[49],"Preliminaries.-":[50],"3.1":[51],"Vectors":[52],"and":[53,72,224,317],"Matrices.-":[54,318],"3.2":[55],"Approximation":[56],"Using":[57,187],"the":[58,173,188,263,270,275],"Taylor":[59],"Series.-":[60],"3.3":[61],"Nonlinear":[64,282,293],"Equations.-":[65,156,321],"3.4":[66],"Quadratic":[67,230,302],"Forms.-":[68],"3.5":[69],"Convex":[70,73,110,245,252],"Functions":[71],"3.6":[76],"4":[78],"Optimality":[79,82,107,202],"Conditions.-":[80,96,102,115],"4.1":[81],"Conditions":[83,108,203,234],"Unconstrained":[85,122,134],"4.2":[87],"Additive":[89],"Property":[90],"Constraints.-":[92],"4.3":[93],"Karush-Kuhn-Tucker":[94],"(KT)":[95],"4.4":[97],"Geometric":[98],"Interpretation":[99],"KT":[101,233],"4.5":[103],"Sensitivity":[104,185],"Analysis.-":[105,178],"4.6":[106],"4.7":[112],"Second-Order":[113],"Sufficient":[114],"4.8":[116],"Lagrangian":[117],"Duality.-":[118],"4.9":[119],"5":[121],"5.1":[124],"Descent":[125,271],"direction.-":[126],"5.2":[127],"Line":[128],"Search":[129],"Techniques-Step":[130],"Length":[131],"Calculations.-":[132],"5.3":[133],"Minimization":[135],"Techniques.-":[136],"5.4":[137],"5.5":[140],"6":[142],"Linear":[143,153,297],"Programming.-":[144,231],"6.1":[145],"LP":[148,162],"6.2":[150],"Solving":[151,320],"a":[152,292],"System":[154],"6.3":[157],"Basic":[158,300,311],"Solutions":[159],"6.4":[164],"Simplex":[166,174,182,190],"Method.-":[167,183,191,212,218,257,277],"6.5":[168],"Unusual":[169],"Situations":[170],"Arising":[171],"During":[172],"Solution.-":[175],"6.6":[176],"Post-Optimality":[177],"6.7":[179],"Revised":[181,189],"6.8":[184],"Analysis":[186],"6.9":[192],"6.10":[195],"7":[197],"Interior":[198,216],"Point":[199,217],"Methods.-":[200,288,307],"7.1":[201],"LP.-":[206],"7.2":[207],"Primal":[209,240],"Affine":[210,241],"Scaling":[211,242],"7.3":[213],"Primal-Dual":[215,249],"7.4":[219],"7.5":[222],"Appendix-Null":[223],"Range":[225],"Spaces.-":[226],"7.6":[227],"8":[229],"8.1":[232],"QP.-":[237,246,253],"8.2":[238],"Method":[243,250,261],"8.3":[247],"8.4":[254],"Active":[255,259],"Set":[256,260],"8.5":[258],"Dual":[264],"QP":[265],"8.6":[267],"Appendix-Derivation":[268],"Direction":[272],"Formula":[273],"PAS":[276],"8.7":[278],"9":[280],"Constrained":[281],"9.1":[284],"Normalization.-":[285],"9.2":[286],"Penalty":[287],"9.3":[289],"Linearization":[290],"9.4":[295],"Sequential":[296,301],"Programming-SLP.-":[298],"9.5":[299],"Programming-SQP.-":[303],"9.6":[304],"Refined":[305],"SQP":[306],"9.7":[308],"A.1":[310],"Manipulations":[312],"in":[313],"Mathematica.-":[314],"A.2":[315],"Lists":[316],"A.3":[319],"A.7":[322],"Online":[323],"Help.":[324]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W40048049","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":8}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}
