Vote for your favorite mineral in #MinCup25! - Stibnite vs. Okenite
It's a battle of dark and light as soft, dramatic stibnite goes up against adorable cottonballs of Okenite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Alejandre, J.L., Allueva, Ana, Gonzalez, Jose Miguel (2004) A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming. Computational Optimization and Applications, 27 (1). 83-93 doi:10.1023/b:coap.0000004981.17496.9c

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming
JournalComputational Optimization and Applications
AuthorsAlejandre, J.L.Author
Allueva, AnaAuthor
Gonzalez, Jose MiguelAuthor
Year2004 (January)Volume27
Issue1
PublisherSpringer Science and Business Media LLC
DOIdoi:10.1023/b:coap.0000004981.17496.9cSearch in ResearchGate
Generate Citation Formats
Mindat Ref. ID9538425Long-form Identifiermindat:1:5:9538425:8
GUID0
Full ReferenceAlejandre, J.L., Allueva, Ana, Gonzalez, Jose Miguel (2004) A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming. Computational Optimization and Applications, 27 (1). 83-93 doi:10.1023/b:coap.0000004981.17496.9c
Plain TextAlejandre, J.L., Allueva, Ana, Gonzalez, Jose Miguel (2004) A General Alternative Procedure for Solving Negative Degree of Difficulty Problems in Geometric Programming. Computational Optimization and Applications, 27 (1). 83-93 doi:10.1023/b:coap.0000004981.17496.9c
In(2004, January) Computational Optimization and Applications Vol. 27 (1) Springer Science and Business Media LLC

See Also

These are possibly similar items as determined by title/reference text matching only.

Yanjun, Wang, Tao, Li, Zhian, Liang (2009) A general algorithm for solving Generalized Geometric Programming with nonpositive degree of difficulty. Computational Optimization and Applications, 44 (1). 139-158 doi:10.1007/s10589-007-9148-3
Xu, Song (2004) A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints. Computational Optimization and Applications, 27 (3). 285-303 doi:10.1023/b:coap.0000013060.16224.31
Drummond, L.M. Graña, Iusem, A.N. (2004) A Projected Gradient Method for Vector Optimization Problems. Computational Optimization and Applications, 28 (1). 5-29 doi:10.1023/b:coap.0000018877.86161.8b
(2004) COAP Best Paper Award. Computational Optimization and Applications, 27 (1). 115pp. doi:10.1023/b:coap.0000005029.22801.b3
Pan, Ping-Qi (2004) A Dual Projective Pivot Algorithm for Linear Programming. Computational Optimization and Applications, 29 (3). 333-346 doi:10.1023/b:coap.0000044185.69640.54
Corry, Paul, Kozan, Erhan (2004) Ant Colony Optimisation for Machine Layout Problems. Computational Optimization and Applications, 28 (3). 287-310 doi:10.1023/b:coap.0000033965.99769.98
Alejandre, J.L., Allueva, A.I., González, J.M. (2000) A new algorithm for geometric programming based on the linear structure of its dual problem. Mathematical and Computer Modelling, 31. 61-78 doi:10.1016/s0895-7177(00)00060-1
Griva, Igor (2004) Numerical Experiments with an Interior-Exterior Point Method for Nonlinear Programming. Computational Optimization and Applications, 29 (2). 173-195 doi:10.1023/b:coap.0000042029.73199.83
Kuo, Yu-Ju, Mittelmann, Hans D. (2004) Interior Point Methods for Second-Order Cone Programming and OR Applications. Computational Optimization and Applications, 28 (3). 255-285 doi:10.1023/b:coap.0000033964.95511.23
Stix, Volker (2004) Finding All Maximal Cliques in Dynamic Graphs. Computational Optimization and Applications, 27 (2). 173-186 doi:10.1023/b:coap.0000008651.28952.b6
Albrecht, Andreas, Wong, Chak-Kuen (2004) Approximation of Boolean Functions by Local Search. Computational Optimization and Applications, 27 (1). 53-82 doi:10.1023/b:coap.0000004980.80957.05
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 2, 2025 18:39:40
Go to top of page