Saved in:
Bibliographic Details
Main Authors: Choudhary, Manohar, Nath, Triloki, Pandey, Ram K.
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.00071
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912931517562880
author Choudhary, Manohar
Nath, Triloki
Pandey, Ram K.
author_facet Choudhary, Manohar
Nath, Triloki
Pandey, Ram K.
contents This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed polygonal chain with weights whose vertices are constrained to lie in the given nonempty, closed, and convex sets, while simultaneously minimizing weighted distances to a central hub point. This coupled formulation naturally models systems in which cyclic internal connectivity and radial access to a hub must be optimized jointly a structural feature that arises in applications such as supply-chain design, transportation planning, and communication infrastructures. Using modern convex analysis tools, we establish existence of optimal solutions under boundedness and general position assumptions of sets, we prove uniqueness when constraint sets are strictly convex with positive weights. We also derive first order necessary and sufficient optimality conditions using subdifferential calculus. For computation, we develop a Projected Subgradient Algorithm (PSA) and we prove convergence of the best-iterate sequence under classical diminishing step size rules. Numerical illustrations in $\mathbb{R}^2$ and $\mathbb{R}^3$ are provided to validate the algorithm's robustness across diverse geometries and weighting schemes.
format Preprint
id arxiv_https___arxiv_org_abs_2603_00071
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Generalized Heron-Waist Problem: Optimality Conditions and Convergence Analysis
Choudhary, Manohar
Nath, Triloki
Pandey, Ram K.
Optimization and Control
51M04, 90C25, 90B85, 52A41, 65K05
This paper introduces and solves the Generalized Heron-Waist Problem (GHWP), that integrates the classical Heron problem of optimal hub location and the waist problem of minimal-perimeter configuration. The GHWP seeks an optimal closed polygonal chain with weights whose vertices are constrained to lie in the given nonempty, closed, and convex sets, while simultaneously minimizing weighted distances to a central hub point. This coupled formulation naturally models systems in which cyclic internal connectivity and radial access to a hub must be optimized jointly a structural feature that arises in applications such as supply-chain design, transportation planning, and communication infrastructures. Using modern convex analysis tools, we establish existence of optimal solutions under boundedness and general position assumptions of sets, we prove uniqueness when constraint sets are strictly convex with positive weights. We also derive first order necessary and sufficient optimality conditions using subdifferential calculus. For computation, we develop a Projected Subgradient Algorithm (PSA) and we prove convergence of the best-iterate sequence under classical diminishing step size rules. Numerical illustrations in $\mathbb{R}^2$ and $\mathbb{R}^3$ are provided to validate the algorithm's robustness across diverse geometries and weighting schemes.
title A Generalized Heron-Waist Problem: Optimality Conditions and Convergence Analysis
topic Optimization and Control
51M04, 90C25, 90B85, 52A41, 65K05
url https://arxiv.org/abs/2603.00071