{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZOTEZEKIDU6ZE4BX5VC3NMMPOR","short_pith_number":"pith:ZOTEZEKI","schema_version":"1.0","canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","source":{"kind":"arxiv","id":"1112.6075","version":1},"attestation_state":"computed","paper":{"title":"A semidefinite programming approach for solving Multiobjective Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.OC","authors_text":"Justo Puerto, Safae El-Haj Ben-Ali, V\\'ictor Blanco","submitted_at":"2011-12-28T07:51:55Z","abstract_excerpt":"Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial in"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1112.6075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-28T07:51:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"8658252f77fa78ab3b64e86f3442f194ea1326edfa3f491ed6df43aa9a6901b0","abstract_canon_sha256":"b6061d217b8a884202177e54c3fbb1971dfd4b48cf4aa4251d42fbd0340ffce8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:36.901242Z","signature_b64":"NDJCSsS7DOdP8eW68a37zklAHCs3LeoJEUDD3Zjn8CnDTnJD8XchtBlGbrvDvkSuL5/kxFIl5B2YC4X6pypPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba64c91481d3d927037ed45b6b18f74666efe1fd3ef51f751a38d8b048ff7cd","last_reissued_at":"2026-05-18T04:05:36.900506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:36.900506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A semidefinite programming approach for solving Multiobjective Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.OC","authors_text":"Justo Puerto, Safae El-Haj Ben-Ali, V\\'ictor Blanco","submitted_at":"2011-12-28T07:51:55Z","abstract_excerpt":"Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm that finds all Pareto-optimal solutions of MOLP. We present an explicit construction, based on a transformation of any MOLP into a finite sequence of SemiDefinite Programs (SDP), the solutions of which give the entire set of Pareto-optimal extreme points solutions of MOLP. These SDP problems are solved by interior point methods; thus our approach provides a pseudo-polynomial in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.6075","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.6075","created_at":"2026-05-18T04:05:36.900643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.6075v1","created_at":"2026-05-18T04:05:36.900643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.6075","created_at":"2026-05-18T04:05:36.900643+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOTEZEKIDU6Z","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOTEZEKIDU6ZE4BX","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOTEZEKI","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR","json":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR.json","graph_json":"https://pith.science/api/pith-number/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/graph.json","events_json":"https://pith.science/api/pith-number/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/events.json","paper":"https://pith.science/paper/ZOTEZEKI"},"agent_actions":{"view_html":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR","download_json":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR.json","view_paper":"https://pith.science/paper/ZOTEZEKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.6075&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/action/storage_attestation","attest_author":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/action/author_attestation","sign_citation":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/action/citation_signature","submit_replication":"https://pith.science/pith/ZOTEZEKIDU6ZE4BX5VC3NMMPOR/action/replication_record"}},"created_at":"2026-05-18T04:05:36.900643+00:00","updated_at":"2026-05-18T04:05:36.900643+00:00"}