Method of Finding Initial Solution for the Geometric Programming Problem
Journal of Advances in Mathematics and Computer Science · pp. 1–10 · Published 6 Nov 2015
10.9734/BJMCS/2016/21873Abstract
The paper proposes a new method for finding an initial solution in the problem of geometric programming. The paper describes the conditions, under which the geometric programming problem of obtaining a positive solution of the matrix equation is solved. This equation describes the orthogonality and normalization conditions. The authors gave an example of application of the method in case of solving the problem of minimizing the risk of the object safety violation for the level crossing (technical object with safety requirements).
Cited by 0
No indexed citations yet.
Related research
- Positive Solutions of Sturm-Liouville Problems for Second Order Singular and Impulsive Differential Equations — shares topic coverage
- Review of the Use of SWAP and FDT for the Early Detection of Visual Field Loss — shares topic coverage
- Formulation and In-vitro Evaluation of Ileo-Colonic Targeted Tablet of Flurbiprofen Using Natural and Semi Synthetic Polymers for Ulcerative Colitis — shares topic coverage
- Pebble Size in Matrix of Palaeoplacer Conglomerate Correlated with Gold Grade — shares topic coverage
- Impact of Geomorphic Variables on Dissection Index in Western Doon of Dehra, Uttarakhand, India — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.