English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This note describes a computational procedure for solving mathematical programs with nonlinear programs in the constraints; it uses the SUMT computer program for the overall mathematical program, and a new program called INSUMT for the nonlinear programs in the constraints. IN AN EARLIER paper,R1] we formulated a class of mathematical programs with optimization problems in the constraints, presented theory dealing with properties of the relevant functions that result in convex programming problems and discussed interpretations. It gives an example with linear programs in the constraints.

Technical Note—A Method for Solving Mathematical Programs with Nonlinear Programs in the Constraints