{"id":{"repo_id":"bu","oai_identifier":"oai:open.bu.edu:2144/29134"},"canonical_url":"https://search.ndltd.org/etd/bu/oai:open.bu.edu:2144/29134","repository":{"repo_id":"bu","name":"Boston University","base_url":"https://open.bu.edu/oai/request"},"display":{"title":"Mathematical methods of linear programming","abstract":"A complex modern society has presented its managers with the need to solve a variety of optimization problems. The desire to run a firm in such a way that profit is maximized, to schedule bombing runs to inflict a maximum of damage on an opponent consistent with acceptable losses, or to choose an assignment of available personnel which optimizes efficiency are typical examples. Such problems are called programming problems. The unifying idea here is that the limited resources (e.g. factors of production, planes, or personnel) which are available for use may be combined in a large (generally infinite) number of ways. The object is to choose from these possibilities the combination or combinations which will optimize a measure of the effectiveness of the enterprise. Mathematically, the programming problem is stated. [TRUNCATED]","abstract_html":"A complex modern society has presented its managers with the need to solve a variety of optimization problems. The desire to run a firm in such a way that profit is maximized, to schedule bombing runs to inflict a maximum of damage on an opponent consistent with acceptable losses, or to choose an assignment of available personnel which optimizes efficiency are typical examples. Such problems are called programming problems. The unifying idea here is that the limited resources (e.g. factors of production, planes, or personnel) which are available for use may be combined in a large (generally infinite) number of ways. The object is to choose from these possibilities the combination or combinations which will optimize a measure of the effectiveness of the enterprise. Mathematically, the programming problem is stated. [TRUNCATED]","abstract_has_math":false,"creators":["Groeneveld, Richard A."],"institution":"Boston University","degree_name":"Master of Arts","degree_level":"masters","degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1963,"date_issued":"1963","date_published":"1963","updated_at":"2026-11-18T20:42:02Z","subjects":["Computer programming","Mathematics"],"languages":["en_US"],"rights":["Based on investigation of the BU Libraries' staff, this work is free of known copyright restrictions."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b14564221"],"render_values":[{"text":"b14564221","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2144/29134","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/2144/29134","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.bu.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopen.bu.edu%3A2144%2F29134","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Groeneveld, Richard A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-05-31T01:52:51Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-05-31T01:52:51Z"]},{"key":"dc:date.issued","label":"Date","values":["1963"]},{"key":"dc:date.submitted","label":"Dc Date Submitted","values":["1963"]},{"key":"dc:publisher","label":"Institution","values":["Boston University"]},{"key":"dc:type","label":"Dc Type","values":["Thesis/Dissertation"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Arts"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Boston University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer programming","Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Based on investigation of the BU Libraries' staff, this work is free of known copyright restrictions."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["b14564221"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/2144/29134"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M.A.)--Boston University"]},{"key":"dc:description.abstract","label":"Abstract","values":["A complex modern society has presented its managers with the need to solve a variety of optimization problems. The desire to run a firm in such a way that profit is maximized, to schedule bombing runs to inflict a maximum of damage on an opponent consistent with acceptable losses, or to choose an assignment of available personnel which optimizes efficiency are typical examples. Such problems are called programming problems. The unifying idea here is that the limited resources (e.g. factors of production, planes, or personnel) which are available for use may be combined in a large (generally infinite) number of ways. The object is to choose from these possibilities the combination or combinations which will optimize a measure of the effectiveness of the enterprise. Mathematically, the programming problem is stated. [TRUNCATED]"]},{"key":"dc:title","label":"Title","values":["Mathematical methods of linear programming"]}]}],"canonical_facts":{"dc:creator":["Groeneveld, Richard A."],"dc:date.accessioned":["2018-05-31T01:52:51Z"],"dc:date.available":["2018-05-31T01:52:51Z"],"dc:date.issued":["1963"],"dc:date.submitted":["1963"],"dc:description":["Thesis (M.A.)--Boston University"],"dc:description.abstract":["A complex modern society has presented its managers with the need to solve a variety of optimization problems. The desire to run a firm in such a way that profit is maximized, to schedule bombing runs to inflict a maximum of damage on an opponent consistent with acceptable losses, or to choose an assignment of available personnel which optimizes efficiency are typical examples. Such problems are called programming problems. The unifying idea here is that the limited resources (e.g. factors of production, planes, or personnel) which are available for use may be combined in a large (generally infinite) number of ways. The object is to choose from these possibilities the combination or combinations which will optimize a measure of the effectiveness of the enterprise. Mathematically, the programming problem is stated. [TRUNCATED]"],"dc:identifier.other":["b14564221"],"dc:identifier.uri":["https://hdl.handle.net/2144/29134"],"dc:language.iso":["en_US"],"dc:publisher":["Boston University"],"dc:rights":["Based on investigation of the BU Libraries' staff, this work is free of known copyright restrictions."],"dc:subject":["Computer programming","Mathematics"],"dc:title":["Mathematical methods of linear programming"],"dc:type":["Thesis/Dissertation"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Arts"],"thesis:institution_name":["Boston University"]},"updated_at":"2026-11-18T20:42:02Z"}