{"id":{"repo_id":"glasgow","oai_identifier":"oai:theses.gla.ac.uk:536"},"canonical_url":"https://search.dev.ndltd.org/etd/glasgow/oai:theses.gla.ac.uk:536","repository":{"repo_id":"glasgow","name":"University of Glasgow","base_url":"https://theses.gla.ac.uk/cgi/oai2"},"display":{"title":"Minimaximal and maximinimal optimisation problems : a partial order-based approach","abstract":"We study a class of optimisation problems called minimaximal and maximinimal optimisation problems. In this thesis, we present the first unifying framework for formulating minimaximal and maximinimal optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders from our collection, we use our framework to obtain a range of minimaximal and maximinimal optimisation problems. We study these individual examples mainly from the point of view of algorithmic complexity.","abstract_html":"We study a class of optimisation problems called minimaximal and maximinimal optimisation problems. In this thesis, we present the first unifying framework for formulating minimaximal and maximinimal optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders from our collection, we use our framework to obtain a range of minimaximal and maximinimal optimisation problems. We study these individual examples mainly from the point of view of algorithmic complexity.","abstract_has_math":false,"creators":["Manlove, David Francis"],"institution":"University of Glasgow","degree_name":null,"degree_level":"PhD","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1998,"date_issued":"1998","date_published":"1998","updated_at":"2026-07-24T02:23:26Z","subjects":["QA Mathematics","QA75 Electronic computers. Computer science","QA76 Computer software"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Manlove, David Francis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["1998"]},{"key":"dc:date.issued","label":"Date","values":["1998"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Glasgow"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://theses.gla.ac.uk/536/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics","QA75 Electronic computers. Computer science","QA76 Computer software"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://theses.gla.ac.uk/536/1/1998manlovephd.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We study a class of optimisation problems called minimaximal and maximinimal optimisation problems. In this thesis, we present the first unifying framework for formulating minimaximal and maximinimal optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders from our collection, we use our framework to obtain a range of minimaximal and maximinimal optimisation problems. We study these individual examples mainly from the point of view of algorithmic complexity."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Minimaximal and maximinimal optimisation problems : a partial order-based approach"]}]}],"canonical_facts":{"dc:creator":["Manlove, David Francis"],"dc:date":["1998"],"dc:date.issued":["1998"],"dc:description.abstract":["We study a class of optimisation problems called minimaximal and maximinimal optimisation problems. In this thesis, we present the first unifying framework for formulating minimaximal and maximinimal optimisation problems, based on a particular partial order concept. To accompany this framework, we define a variety of partial orders, an important example being the partial order of set inclusion. By considering various source optimisation problems from the literature, and partial orders from our collection, we use our framework to obtain a range of minimaximal and maximinimal optimisation problems. We study these individual examples mainly from the point of view of algorithmic complexity."],"dc:format":["application/pdf"],"dc:identifier.uri":["https://theses.gla.ac.uk/536/1/1998manlovephd.pdf"],"dc:language":["en"],"dc:publisher.institution":["University of Glasgow"],"dc:relation.isreferencedby":["https://theses.gla.ac.uk/536/"],"dc:subject":["QA Mathematics","QA75 Electronic computers. Computer science","QA76 Computer software"],"dc:title":["Minimaximal and maximinimal optimisation problems : a partial order-based approach"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["PhD"]},"updated_at":"2026-07-24T02:23:26Z"}