Indexed metadata

A global optimization approach utilizing convex relaxation for linear multiplicative programming problems

Bo Zhang, Suxia Ma, Kai Cao

Source record

Source: Crossref

Published: Jan 3, 2026

DOI: 10.1007/s12190-025-02715-6

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A global optimization approach utilizing convex relaxation for linear multiplicative programming problems — Mathematical Frontier Network